Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems
From MaRDI portal
Publication:846294
DOI10.1007/978-3-642-11881-4zbMath1181.03044OpenAlexW4229924305MaRDI QIDQ846294
Publication date: 9 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11881-4
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Quantum algorithm for lexicographically minimal string rotation ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ Linear-time temporal logics with Presburger constraints: an overview ★ ⋮ On the relationships between theories of time granularity and the monadic second-order theory of one successor
