Regular Marked Petri Nets

A class of Petri nets called regular marked nets is introduced. Its definition refers to the linear algebraic representation of nets. It is shown that every regular marked net is live — i.e. no transition can get deadlocked — and bounded — i.e. its state space is finite. In turn, live and bounded marked extended free choice nets are a proper subclass of regular marked nets. A series of results concerning behavioural properties — i.e. properties of the corresponding state graph — which are known for live and bounded marked extended free choice nets are shown to hold for regular marked nets.

[1]  Esteban Feuerstein,et al.  Petri Nets, Hypergraphs and Conflicts (Preliminary Version) , 1992, WG.

[2]  Manuel Silva Suárez,et al.  On the analysis and synthesis of free choice systems , 1991, Applications and Theory of Petri Nets.

[3]  Marco Ajmone Marsan,et al.  Application and Theory of Petri Nets 1993 , 1993, Lecture Notes in Computer Science.

[4]  Jörg Desel,et al.  Shortest Paths in Reachability Graphs , 1993, Application and Theory of Petri Nets.

[5]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

[6]  Kurt Jensen,et al.  Application and Theory of Petri Nets 1992 , 1992, Lecture Notes in Computer Science.

[7]  Jörg Desel,et al.  Traps Characterize Home States in Free Choice Systems , 1992, Theor. Comput. Sci..

[8]  Grzegorz Rozenberg.  Advances in Petri Nets 1990 , 1989, Lecture Notes in Computer Science.

[9]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

[10]  Jörg Desel,et al.  A Proof of the Rank Theorem for Extended Free Choice Nets , 1992, Application and Theory of Petri Nets.

[11]  Matthias Jantzen.  Complexity of Place/Transition Nets , 1986 .

[12]  Javier Esparza.  Synthesis Rules for Petri Nets, and How they Lead to New Results , 1990, CONCUR.

[13]  Manuel Silva,et al.  Properties and performance bounds for closed free choice synchronized monoclass queueing networks , 1991 .

[14]  Jörg Desel,et al.  Reachability in Cyclic Extended Free-Choice Systems , 1993, Theor. Comput. Sci..