The Downward-Closure of Petri Net Languages

DOI10.1007/978-3-642-14162-1_39zbMath1288.68181OpenAlexW1503681652MaRDI QIDQ3587461

Harro Wimmel, Roland Meyer, Peter Habermehl

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)

Related Items (8)

An Approach to Computing Downward Closures ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Existential Definability over the Subword Ordering ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity ⋮ Unnamed Item

This page was built for publication: The Downward-Closure of Petri Net Languages