Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431318
DOI10.1007/b11836zbMath1124.68385OpenAlexW2495578842MaRDI QIDQ5431318
Publication date: 7 December 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11836
Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (7)
A simple rewrite system for the normalization of linear temporal logic ⋮ Dissecting \texttt{ltlsynt} ⋮ Mechanizing the Powerset Construction for Restricted Classes of ω-Automata ⋮ On the translation of automata to linear temporal logic ⋮ A first-order logic characterisation of safety and co-safety languages ⋮ Distributed breadth-first search LTL model checking ⋮ On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
This page was built for publication: Mathematical Foundations of Computer Science 2003
