On Decidability of LTL Model Checking for Process Rewrite Systems

DOI10.1007/11944836_24MaRDI QIDQ5385990zbMATH OpenOpenAlexFDO

Authors Laura Bozzelli, Vojtěch Řehák, Jan Strejček, Mojmír Křetínský

Publication date 17 April 2008

Published in FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11944836_24

Mathematics Subject Classification ID

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

Recommendations

• On decidability of LTL model checking for process rewrite systems
• On Decidability of LTL+Past Model Checking for Process Rewrite Systems
• Model checking for process rewrite systems and a class of action-based regular properties
• Verification, Model Checking, and Abstract Interpretation
• LTL model checking for recursive programs
• LTL Generalized Model Checking Revisited
• LTL on finite and process traces: complexity results and a practical reasoner
• scientific article; zbMATH DE number 1948409
• Term Rewriting and Applications

Cited in

(6)

• On Decidability of LTL+Past Model Checking for Process Rewrite Systems
• Verification, Model Checking, and Abstract Interpretation
• On decidability of LTL model checking for process rewrite systems
• Model checking for process rewrite systems and a class of action-based regular properties
• Negative Results on Decidability and Small Model Property of Process Equations
• Modal process rewrite systems

This page was built for publication: On Decidability of LTL Model Checking for Process Rewrite Systems

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