Free choice Petri nets. (English) Zbl 0836.68074

Cambridge Tracts in Theoretical Computer Science. 40. Cambridge: Cambridge Univ. Press. viii, 244 p. (1995).
The basic definitions of the \(S\)-, \(T\)-, and free-choice Petri nets and systems are introduced. The properties liveness, deadlock-freedom, \(S\)-, and \(T\)-coverability, reachability, and other are studied. Rules for reduction and synthesis of nets are described. Some generalizations of the free-choice nets (e.g. asymmetric-choice nets, feedback-free nets) are defined.


68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
Full Text: DOI