Deterministic weak-and-marked Petri net languages are regular
Open Access
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 41 (12), 1802-1803
- https://doi.org/10.1109/9.545718
Abstract
The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the class of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages. Published as: S. Gaubert, A. Giua, Deterministic Weak-and-Marked Petri Net Languages Are Regular, " IEEE Trans. on Automatic Control, Vol. 41, No. 12, pp. 1802-1803, December,1996. 1 1Keywords
This publication has 4 references indexed in Scilit:
- Decidability and closure properties of weak Petri net languages in supervisory controlIEEE Transactions on Automatic Control, 1995
- A note on deciding the controllability of a language K with respect to a language LIEEE Transactions on Automatic Control, 1993
- Petri nets and regular languagesJournal of Computer and System Sciences, 1981
- Vector addition systems and regular languagesJournal of Computer and System Sciences, 1980