scientific article; zbMATH DE number 1500644
From MaRDI portal
Publication:4501666
zbMATH Open0952.03017MaRDI QIDQ4501666FDOQ4501666
Publication date: 7 November 2000
Title of this publication is not available (Why is that?)
computation tree logicexpressivenesssuccinctnessmodal \(\mu\)-calculusalternating 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)
Cited In (23)
- ATL* Satisfiability Is 2EXPTIME-Complete
- A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL
- From bidirectionality to alternation.
- Model-checking graded computation-tree logic with finite path semantics
- Improved model checking of hierarchical systems
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
- To be fair, use bundles
- \textit{Once} and \textit{for all}
- The Complexity of CTL* + Linear Past
- Title not available (Why is that?)
- Refinement modal logic
- Title not available (Why is that?)
- Branching-Time Temporal Logics with Minimal Model Quantifiers
- Comparing the succinctness of monadic query languages over finite trees
- Strategic reasoning with a bounded number of resources: the quest for tractability
- Branching-time logics repeatedly referring to states
- On temporal logic versus Datalog
- An Automata-Theoretic Approach to Infinite-State Systems
- A decidable timeout-based extension of linear temporal logic
- On the Way to Alternating Weak Automata
- On the expressivity and complexity of quantitative branching-time temporal logics
- A modal logic framework for reasoning about comparative distances and topology
- Branching-time logics with path relativisation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501666)
