Petri net languages and infinite subsets of N^m

DOI10.1006/JCSS.1999.1634MaRDI QIDQ1970198zbMATH OpenOpenAlexFDO

Authors Stéphane Gaubert, Alessandro Giua

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

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Subset languages of Petri nets. I: The relationship to string languages and normal forms
• scientific article; zbMATH DE number 29612
• scientific article; zbMATH DE number 4098730
• Some results on Petri net languages
• Towards a hierarchy of nets

Cites work

• A logical approach of Petri net languages
• A note on deciding the controllability of a language K with respect to a language L
• A survey of Petri net methods for controlled discrete event systems
• Control of vector discrete-event systems. I. The base model
• Decidability and closure properties of weak Petri net languages in supervisory control
• Deterministic weak-and-marked Petri net languages are regular
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 3959244 (Why is no real title available?)
• scientific article; zbMATH DE number 4024805 (Why is no real title available?)
• scientific article; zbMATH DE number 4035163 (Why is no real title available?)
• scientific article; zbMATH DE number 4037246 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 53942 (Why is no real title available?)
• scientific article; zbMATH DE number 3628412 (Why is no real title available?)
• scientific article; zbMATH DE number 627763 (Why is no real title available?)
• scientific article; zbMATH DE number 763717 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Rational sets in commutative monoids
• Star-free trace languages

Cited in

(13)

• Super-nets and their hierarchy
• Towards a hierarchy of nets
• State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions
• Real time identification of discrete event systems using Petri nets
• Limited codes associated with Petri nets
• scientific article; zbMATH DE number 3915636 (Why is no real title available?)
• scientific article; zbMATH DE number 4024816 (Why is no real title available?)
• scientific article; zbMATH DE number 29612 (Why is no real title available?)
• scientific article; zbMATH DE number 777281 (Why is no real title available?)
• Supervisory Control of Petri Nets with Language Specifications
• Pushdown automata, multiset automata, and Petri nets
• Subset languages of Petri nets. I: The relationship to string languages and normal forms
• Subset languages of Petri nets. II. Closure properties

This page was built for publication: Petri net languages and infinite subsets of \(\mathbb{N}^m\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970198)