Infinite behaviour of Petri nets

DOI10.1016/0304-3975(83)90115-9zbMath0559.68057OpenAlexW2082483369MaRDI QIDQ2265817

Ruediger Valk

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)90115-9

zbMATH Keywords

fairnessPetri netinclusion propertiesomega languageclasses of languages

Mathematics Subject Classification ID

Related Items (9)

Fair Petri nets and structural induction for rings of processes ⋮ The Wadge Hierarchy of Petri Nets ω-Languages ⋮ Somewhat finite approaches to infinite sentences. ⋮ On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets ⋮ \(X\)-automata on \(\omega\)-words ⋮ Time-based expressivity of time Petri nets for system specification ⋮ The residue of vector sets with applications to decidability problems in Petri nets ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words

Cites Work

• A calculus of communicating systems
• Adherences of languages
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Computation sequence sets
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• \(\omega\)-computations on Turing machines
• Parallel program schemata
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Infinite behaviour of Petri nets