Model Checking Synchronized Products of Infinite Transition Systems

DOI10.2168/LMCS-3(4:5)2007zbMATH Open1131.68065MaRDI QIDQ5453498FDOQ5453498

Authors: Stefan Wöhrle, Wolfgang Thomas 

Publication date: 1 April 2008

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Recommendations

• COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS
• Decidability of model checking for infinite-state concurrent systems
• Automated Technology for Verification and Analysis
• A decidability result for the model checking of infinite-state systems
• scientific article; zbMATH DE number 1263840

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (7)

• Compositional failure detection in structured transition systems
• COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS
• Kleene Theorems for Synchronous Products with Matching
• Tutorial on parameterized model checking of fault-tolerant distributed algorithms
• Model Checking FO(R) over One-Counter Processes and beyond
• The compositional method and regular reachability
• Foundations of a theory of synchronous systems

This page was built for publication: Model Checking Synchronized Products of Infinite Transition Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453498)