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