A hierarchy of temporal logics with past

DOI10.1016/0304-3975(95)00035-UzbMATH Open0873.68068OpenAlexW1998387957WikidataQ126298498 ScholiaQ126298498MaRDI QIDQ672329FDOQ672329

Authors: Ph Schnoebelen, François Laroussinie 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00035-u

Recommendations

• \textit{Once} and \textit{for all}
• An infinite hierarchy of temporal logics over branching time
• scientific article; zbMATH DE number 1231598
• scientific article; zbMATH DE number 3940713
• Specification in CTL + past for verification in CTL.

zbMATH Keywords

temporal logics

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Characterizing finite Kripke structures in propositional temporal logic
• Symbolic model checking: \(10^{20}\) states and beyond
• 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?)
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Decision procedures and expressiveness in the temporal logic of branching time
• “Sometimes” and “not never” revisited
• Title not available (Why is that?)
• Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL
• The temporal logic of branching time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization of temporal property classes
• Translations between modal logics of reactive systems

Cited In (33)

• Title not available (Why is that?)
• An infinite hierarchy of temporal logics over branching time
• A survey on temporal logics for specifying and verifying real-time systems
• Back from the future
• On the Complexity of Branching-Time Logics
• Interval vs. point temporal logic model checking. An expressiveness comparison
• Regular linear temporal logic with past
• Axiomatization of a branching time logic with indistinguishability relations
• Results on alternating-time temporal logics with linear past
• Alternating-time temporal logics with linear past
• Inconsistency-tolerant temporal reasoning with hierarchical information
• Title not available (Why is that?)
• On the Hybrid Extension of CTL and CTL +
• \textit{Once} and \textit{for all}
• The Complexity of CTL* + Linear Past
• Temporal logic and fair discrete systems
• Past is for free: on the complexity of verifying linear temporal properties with past
• A branching time logic with past operators
• Hybrid and first-order complete extensions of CaRet
• Past is for free: On the complexity of verifying linear temporal properties with past
• The modalized Heyting calculus: a conservative modal extension of the intuitionistic logic
• Formal Modeling and Analysis of Timed Systems
• Specification in CTL + past for verification in CTL.
• Event identifier logic
• Branching-time logics repeatedly referring to states
• An axiomatization of PCTL*
• Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
• Temporal multi-valued logic with lost worlds in the past
• Multi-Valued Reasoning about Reactive Systems
• Past, present, and infinite future
• CaRet with forgettable past
• About the expressive power of CTL combinators
• Translations between modal logics of reactive systems

This page was built for publication: A hierarchy of temporal logics with past

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