Axiomatising extended computation tree logic
From MaRDI portal
Publication:5878903
DOI10.1007/3-540-61064-2_31OpenAlexW2112547704MaRDI QIDQ5878903
Publication date: 23 February 2023
Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61064-2_31
Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)
Cites Work
- Results on the propositional \(\mu\)-calculus
- Hierarchies of weak automata and weak monadic formulas
- An automata theoretic decision procedure for the propositional mu- calculus
- Local model checking in the modal mu-calculus
- Reasoning about infinite computations
- Alternative semantics for temporal logics
- Decision procedures and expressiveness in the temporal logic of branching time
- Temporal logic can be more expressive
- Deciding full branching time logic
- Testing and generating infinite sequences by a finite automaton
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Axiomatising extended computation tree logic