On the \(\omega\)-language expressive power of extended Petri nets
From MaRDI portal
Publication:2491637
DOI10.1016/j.tcs.2006.02.008zbMath1092.68066MaRDI QIDQ2491637
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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Catalytic and communicating Petri nets are Turing complete, A classification of the expressive power of well-structured transition systems, The polynomial complexity of vector addition systems with states, A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
Cites Work