Comparing the Expressive Power of Well-Structured Transition Systems
DOI10.1007/978-3-540-74915-8_11zbMATH Open1179.68065OpenAlexW1599148369MaRDI QIDQ3608407FDOQ3608407
Authors: Giorgio Delzanno, Laurent Van Begin, Parosh A. Abdulla 
Publication date: 5 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_11
Recommendations
- A classification of the expressive power of well-structured transition systems
- Well-structured languages
- Ordinal theory for expressiveness of well-structured transition systems
- Ordinal theory for expressiveness of well structured transition systems
- On the \(\omega\)-language expressive power of extended Petri nets
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (6)
- A classification of the expressive power of well-structured transition systems
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Title not available (Why is that?)
- Regular separability of well-structured transition systems
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
This page was built for publication: Comparing the Expressive Power of Well-Structured Transition Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608407)
