Algorithm for Generating the Top of the Tree of Reachability for Analysis of the Properties of Deterministic and Nondeterministic Petri Nets.

For the most recent entries see the Petri Nets Newsletter.

Algorithm for Generating the Top of the Tree of Reachability for Analysis of the Properties of Deterministic and Nondeterministic Petri Nets.

In: Elektrotechnicky Casopis, Vol. 40, No. 8, pages 617-622. 1989. In Slovakian.

Abstract: The authors present an algorithm which is suitable for analysis of parallel discrete systems with the aid of deterministic and nondeterministic Petri nets. The algorithm was implemented by means of the PL/1 language using the ES 1033 computer.

Keywords: reachability tree; net analysis; PL/1; parallel discrete system.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography