Verification of well-formed communicating recursive state machines
DOI10.1016/j.tcs.2008.06.012zbMath1154.68078OpenAlexW4248796439MaRDI QIDQ944388
Laura Bozzelli, Adriano Peron, Salvatore La Torre
Publication date: 16 September 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.012
model checkinginfinite-state systemstree automatapushdown systemscontext-free specificationsformal models of concurrency and recursionlinear-time logics
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- Automata-theoretic techniques for modal logics of programs
- Statecharts: a visual formalism for complex systems
- Process rewrite systems.
- Model checking LTL with regular valuations for pushdown systems
- A generic approach to the static analysis of concurrent programs with procedures
- On the analysis of interacting pushdown systems
- Process Algebra
- Fair termination is decidable for ground systems
- Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Tools and Algorithms for the Construction and Analysis of Systems
- Context-Bounded Analysis of Concurrent Queue Systems
- Tree generating regular systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- CONCUR 2005 – Concurrency Theory
- Constrained properties, semilinear systems, and Petri nets
This page was built for publication: Verification of well-formed communicating recursive state machines
