Petri Net Languages and Infinite Subsets of Nm
- 1 December 1999
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 59 (3), 373-391
- https://doi.org/10.1006/jcss.1999.1634
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Deterministic weak-and-marked Petri net languages are regularIEEE Transactions on Automatic Control, 1996
- Decidability and closure properties of weak Petri net languages in supervisory controlIEEE Transactions on Automatic Control, 1995
- Control of vector discrete-event systems. I. The base modelIEEE Transactions on Automatic Control, 1993
- A note on deciding the controllability of a language K with respect to a language LIEEE Transactions on Automatic Control, 1993
- Star-free trace languagesTheoretical Computer Science, 1992
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- The control of discrete event systemsProceedings of the IEEE, 1989
- A logical approach of Petri net languagesTheoretical Computer Science, 1985
- Rational sets in commutative monoidsJournal of Algebra, 1969