Publication:4501666
From MaRDI portal
zbMath0952.03017MaRDI QIDQ4501666
Publication date: 7 November 2000
expressiveness; modal \(\mu\)-calculus; computation tree logic; succinctness; alternating tree automaton; lengths of formulas
03D05: Automata and formal grammars in connection with logical questions
68Q60: Specification and verification (program logics, model checking, etc.)
03B44: Temporal logic
Related Items
A decidable timeout-based extension of linear temporal logic, Comparing the succinctness of monadic query languages over finite trees, Unnamed Item, The Complexity of CTL* + Linear Past, Branching-time logics with path relativisation, Improved model checking of hierarchical systems, \textit{Once} and \textit{for all}, Refinement modal logic, A modal logic framework for reasoning about comparative distances and topology, A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL, Branching-time logics repeatedly referring to states, From bidirectionality to alternation., On the expressivity and complexity of quantitative branching-time temporal logics, On temporal logic versus Datalog, Model-checking graded computation-tree logic with finite path semantics, To be fair, use bundles, \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\), ATL* Satisfiability Is 2EXPTIME-Complete, An Automata-Theoretic Approach to Infinite-State Systems, Branching-Time Temporal Logics with Minimal Model Quantifiers
