Subset languages of Petri nets. II. Closure properties

DOI10.1016/0304-3975(83)90094-4zbMATH Open0545.68070OpenAlexW2066929101MaRDI QIDQ797296FDOQ797296

Authors: R. Verraedt, Grzegorz Rozenberg 

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90094-4

Recommendations

• On the properties of the intersection of Petri net languages and context free languages
• Subset languages of Petri nets. I: The relationship to string languages and normal forms
• scientific article; zbMATH DE number 4035163
• scientific article; zbMATH DE number 14490
• Petri net languages and infinite subsets of \(\mathbb{N}^m\)

zbMATH Keywords

Closure propertiessubset languages of Petri nets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Subset languages of Petri nets. I: The relationship to string languages and normal forms
• Super-nets and their hierarchy

Cited In (9)

• Decidability and closure properties of weak Petri net languages in supervisory control
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subset languages of Petri nets. I: The relationship to string languages and normal forms
• Synchronized shuffle operation of Petri net languages and its applications in analysis for language behaviors
• Multisets and Petri nets: an overview
• Title not available (Why is that?)
• On the properties of the intersection of Petri net languages and context free languages
• Title not available (Why is that?)

This page was built for publication: Subset languages of Petri nets. II. Closure properties

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