Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
From MaRDI portal
Publication:3557854
DOI10.1007/978-3-642-12032-9_16zbMath1284.68416OpenAlexW1869685613MaRDI QIDQ3557854
Anthony Widjaja To, Leonid O. Libkin
Publication date: 27 April 2010
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12032-9_16
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items (9)
The Complexity of Reversal-Bounded Model-Checking ⋮ Regular model checking revisited ⋮ Synchronizing relations on words ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Graph Logics with Rational Relations ⋮ Closure properties of synchronized relations
This page was built for publication: Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
