Petri net languages and infinite subsets of \(\mathbb{N}^m\)

DOI10.1006/jcss.1999.1634zbMath0958.68120MaRDI QIDQ1970198

Alessandro Giua, Stéphane Gaubert

Publication date: 19 March 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1634

zbMATH Keywords

Petri net languages

Mathematics Subject Classification ID

68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions

Cites Work

• A logical approach of Petri net languages
• Star-free trace languages
• A survey of Petri net methods for controlled discrete event systems
• Rational sets in commutative monoids
• Deterministic weak-and-marked Petri net languages are regular
• Control of vector discrete-event systems. I. The base model
• Decidability and closure properties of weak Petri net languages in supervisory control
• A note on deciding the controllability of a language K with respect to a language L
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item