The downward-closure of Petri net languages

DOI10.1007/978-3-642-14162-1_39zbMATH Open1288.68181OpenAlexW1503681652MaRDI QIDQ3587461FDOQ3587461

Authors: Peter Habermehl, Roland Meyer, Harro Wimmel 

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_39

Recommendations

• scientific article; zbMATH DE number 7204383
• The complexity of downward closure comparisons
• scientific article; zbMATH DE number 4035163
• On the regularity of Petri net languages
• Deterministic weak-and-marked Petri net languages are regular

Mathematics Subject Classification ID

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

Cited In (11)

• Decidability and closure properties of weak Petri net languages in supervisory control
• Computing Petri net languages by reductions
• Title not available (Why is that?)
• Unboundedness Problems for Languages of Vector Addition Systems.
• The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
• Cost Automata, Safe Schemes, and Downward Closures
• Existential Definability over the Subword Ordering
• Title not available (Why is that?)
• An Approach to Computing Downward Closures
• On the state complexity of closures and interiors of regular languages with subwords and superwords
• Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity

This page was built for publication: The downward-closure of Petri net languages

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