An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems

DOI10.1016/S1571-0661(04)00213-0zbMath1260.68270OpenAlexW2035355499MaRDI QIDQ4917080

Anne Labroue, Philippe Schnoebelen

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)00213-0

zbMATH Keywords

process algebramodel checkingreachability analysistree automataverification of infinite-state systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Cites Work

• Process rewrite systems.
• Process Algebra
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• Decidability of model checking with the temporal logic EF
• Well-structured transition systems everywhere!
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems