On Decidability of LTL Model Checking for Process Rewrite Systems

DOI10.1007/11944836_24zbMath1177.68143OpenAlexW2103150901MaRDI QIDQ5385990

Jan Strejček, Vojtěch Řehák, Laura Bozzelli, 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) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (2)

On Decidability of LTL+Past Model Checking for Process Rewrite Systems ⋮ On decidability of LTL model checking for process rewrite systems

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