On the \(\omega\)-language expressive power of extended Petri nets

DOI10.1016/j.tcs.2006.02.008zbMath1092.68066OpenAlexW2115049824MaRDI QIDQ2491637

Yanyan Li

Publication date: 29 May 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.02.008

zbMATH Keywords

expressiveness\(\omega \)-languages(extended) Petri nets

Mathematics Subject Classification ID

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

Related Items (4)

The polynomial complexity of vector addition systems with states ⋮ Catalytic and communicating Petri nets are Turing complete ⋮ A classification of the expressive power of well-structured transition systems ⋮ A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations

Cites Work

• Reduction and covering of infinite reachability trees
• Reasoning about systems with many processes
• 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: On the \(\omega\)-language expressive power of extended Petri nets