A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
From MaRDI portal
Publication:3618568
DOI10.1007/978-3-642-00982-2_6zbMath1234.68188OpenAlexW1545777893MaRDI QIDQ3618568
Giorgio Delzanno, Laurent Van Begin, Parosh Aziz Abdulla
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_6
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
Synthesis of Petri Nets with Whole-Place Operations and Localities ⋮ The polynomial complexity of vector addition systems with states ⋮ Applying regions
Cites Work
- Unnamed Item
- Unnamed Item
- A well-structured framework for analysing Petri net extensions
- Unreliable channels are easier to verify than perfect channels
- Verifying programs with unreliable channels
- On the \(\omega\)-language expressive power of extended Petri nets
- Well-structured languages
- Comparing the Expressive Power of Well-Structured Transition Systems
- Nets with Tokens Which Carry Data
- A classification of symbolic transition systems
- Well-structured transition systems everywhere!
This page was built for publication: A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations