Alternating automata: unifying truth and validity checking for temporal logics
From MaRDI portal
Recommendations
Cites work
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- Alternating automata on infinite trees
- Alternating finite automata on -words
- Alternation
- Automata-theoretic techniques for modal logics of programs
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Deciding full branching time logic
- Decision procedures and expressiveness in the temporal logic of branching time
- scientific article; zbMATH DE number 3887063 (Why is no real title available?)
- scientific article; zbMATH DE number 3940713 (Why is no real title available?)
- scientific article; zbMATH DE number 3972842 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 88991 (Why is no real title available?)
- scientific article; zbMATH DE number 177248 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1479635 (Why is no real title available?)
- scientific article; zbMATH DE number 3999901 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- On equations for regular languages, finite automata, and sequential networks
- Propositional dynamic logic of regular programs
- Reasoning about infinite computations
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- The complementation problem for Büchi automata with applications to temporal logic
- The complexity of propositional linear temporal logics
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Weak alternating automata are not that weak
Cited in
(19)- An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
- Checking finite traces using alternating automata
- Branching-time temporal logic and tree automata
- Verification
- Taming past LTL and flat counter systems
- Alternating automata and temporal logic normal forms
- scientific article; zbMATH DE number 1670842 (Why is no real title available?)
- Size-change termination and satisfiability for linear-time temporal logics
- Symbolic model checking for alternating projection temporal logic
- Logic programming approach to automata-based decision procedures
- scientific article; zbMATH DE number 1487477 (Why is no real title available?)
- scientific article; zbMATH DE number 1759492 (Why is no real title available?)
- scientific article; zbMATH DE number 1931697 (Why is no real title available?)
- Model Theoretic Syntax and Parsing
- An automata-theoretic approach to branching-time model checking
- Incremental reasoning on monadic second-order logics with logic programming
- Alternating automata modulo first order theories
- Temporal logics with language parameters
- Explaining Hyperproperty Violations
This page was built for publication: Alternating automata: unifying truth and validity checking for temporal logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5234701)
