Comparing the Expressive Power of Well-Structured Transition Systems
From MaRDI portal
Publication:3608407
DOI10.1007/978-3-540-74915-8_11zbMath1179.68065OpenAlexW1599148369MaRDI QIDQ3608407
Laurent Van Begin, Giorgio Delzanno, Parosh Aziz 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
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (6)
Unnamed Item ⋮ A classification of the expressive power of well-structured transition systems ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations ⋮ Unnamed Item ⋮ Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
This page was built for publication: Comparing the Expressive Power of Well-Structured Transition Systems