*For the most recent entries see the
Petri Nets Newsletter.*

## Regular marked Petri nets.

Desel, Jörg
In:
van Leeuwen, J.: *Lecture Notes in Computer Science, Vol. 790; Proceedings of Graph-Theoretic Concepts in Computer Science (WG'93), Utrecht, Jun 1993*, pages 276-287.
Springer-Verlag,
1994.

Abstract:
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.

*Do you need a refined search? Try our search engine
which allows complex field-based queries.*
*Back to the Petri Nets Bibliography*