Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems

DOI10.1007/978-3-642-11881-4MaRDI QIDQ846294zbMATH OpenOpenAlexFDO

Authors Gabriele Puppis

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

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) 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)

Recommendations

• Dependency structures and lexicalized grammars. An algebraic approach
• Logics and automata for verification: Expressiveness and decidability issues
• Temporal logic. Vol. 2. Mathematical foundations and computational aspects
• Temporal logic and state systems
• Temporal logics in computer science. Finite-state systems

Cited in

(5)

• Quantum algorithm for lexicographically minimal string rotation
• On the relationships between theories of time granularity and the monadic second-order theory of one successor
• Dependency structures and lexicalized grammars. An algebraic approach
• Verification of qualitative \(\mathbb Z\) constraints
• Linear-time temporal logics with Presburger constraints: an overview

This page was built for publication: Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846294)