The downward-closure of Petri net languages

DOI10.1007/978-3-642-14162-1_39MaRDI QIDQ3587461zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(12)

• The ideal approach to computing closed subsets in well-quasi-orderings
• Cost Automata, Safe Schemes, and Downward Closures
• Unboundedness problems for languages of vector addition systems
• Existential Definability over the Subword Ordering
• scientific article; zbMATH DE number 7204383 (Why is no real title available?)
• The complexity of downward closure comparisons
• On the state complexity of closures and interiors of regular languages with subwords and superwords
• An approach to computing downward closures
• scientific article; zbMATH DE number 4035163 (Why is no real title available?)
• Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
• Computing Petri net languages by reductions
• Decidability and closure properties of weak Petri net languages in supervisory control

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)