Verification of reactive systems. Formal methods and algorithms.
From MaRDI portal
Publication:1395897
zbMath1067.68092MaRDI QIDQ1395897
Publication date: 2 July 2003
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (11)
Assumption-based runtime verification ⋮ On the complexity of linear temporal logic with team semantics ⋮ Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata ⋮ From LP formulas of the form \(F(t)\) to \(-\omega \)-regular expressions ⋮ Symbolic graphs: Linear solutions to connectivity related problems ⋮ Characterizing CTL-like logics on finite trees. ⋮ Modelling of Complex Software Systems: A Reasoned Overview ⋮ Unnamed Item ⋮ Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems ⋮ Cascade Products and Temporal Logics on Finite Trees ⋮ Shift-invariant topologies for the Cantor space \(X^{\omega}\)
This page was built for publication: Verification of reactive systems. Formal methods and algorithms.
