BTL₂ and the expressive power of ECTL^+

DOI10.1016/J.IC.2005.07.006zbMATH Open1110.68076OpenAlexW4205759389MaRDI QIDQ2500472FDOQ2500472

Authors: Alexander Rabinovich, Philippe Schnoebelen 

Publication date: 16 August 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.07.006

Recommendations

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• On the Expressive Power of QLTL
• CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
• About the expressive power of CTL combinators
• scientific article; zbMATH DE number 139986
• scientific article; zbMATH DE number 7440178
• Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
• On the expressive power of \textsc{Klaim}-based calculi
• On the expressive power of \textsc{Klaim}-based calculi

zbMATH Keywords

model checkingexpressivity of branching-time temporal logic

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• The complexity of propositional linear temporal logics in simple cases
• Future temporal logic needs infinitely many modalities
• The complexity of propositional linear temporal logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Title not available (Why is that?)
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Title not available (Why is that?)
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• The polynomial-time hierarchy
• Decision procedures and expressiveness in the temporal logic of branching time
• An application of games to the completeness problem for formalized theories
• “Sometimes” and “not never” revisited
• Title not available (Why is that?)
• The temporal logic of branching time
• Modalities for model checking: Branching time logic strikes back
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• First-order logic with two variables and unary temporal logic
• Model checking a path (preliminary report)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The decision problem for branching time logic
• An infinite hierarchy of temporal logics over branching time
• Title not available (Why is that?)
• Monadic Logic of Order over Naturals has no Finite Base
• Counting on CTL\(^*\): On the expressive power of monadic path logic

Cited In (5)

• Branching-time logics and fairness, revisited
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• A clausal resolution method for branching-time logic \(\text{ECTL}^+\)
• Title not available (Why is that?)
• Arity hierarchy for temporal logics

This page was built for publication: \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500472)