Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers

  title={Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers},
  author={Dennis Dams},
  journal={Log. J. IGPL},
  • D. Dams
  • Published 1999
  • Philosophy
  • Log. J. IGPL
We study both the expressive and the distinguishing powers of at temporal logics. These are fragments obtained by restricting the ??rst argument of the Until operator to propositional formulae. Both the linear-time and the branching-time cases are considered. 

Figures from this paper

The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract)
Whether there exist some interesting fragments of PLTL with a lower worst-case complexity to help understand why PLTL model-checkers are successfully used in practice is investigated.
Linear-time temporal logics with Presburger constraints: an overview ★
  • S. Demri
  • Computer Science
    J. Appl. Non Class. Logics
  • 2006
The paper recalls the general framework of LTL over concrete domains and presents the main decidability and complexity results related to fragments of Presburger LTL.
The Complexity of Propositional Linear Temporal Logics in Simple Cases
This article considers model checking and satisfiability for all fragments of PLTL obtainable by restricting (1) the temporal connectives allowed, (2) the number of atomic propositions, and (3) theporal height.
Automatic Construction of Complete Abstraction by Abstract Interpretation
In order to eliminate spurious counterexamples, the paper describes a method for minimally making abstract interpretations complete, and this refined complete abstract domain always exists.
Almost Linear Büchi Automata
This work introduces a new fragment of Linear temporal logic (LTL) called LIO and a new class of Buechi automata (BA) called Almost linear BueCHIAutomata (ALBA) showing that the two formalisms are expressively equivalent and providing effective translations between L IO and ALBA.
Flatness Is Not a Weakness
It is proved, in the spirit of the correspondence between automata and temporal logics, that the models of a Lp+ formula are recognized by a piecewise flat counter machine; this shows that validity and model-checking positive formulas are undecidable for Lp+.
On the Expressiveness of MTL Variants over Dense Time
It is proved that the expressiveness of the resulting MTL variants over dense time is not affected by the variations when considering non-Zeno interpretations and arbitrary nesting of temporal operators.
Inheritance of Temporal Logic Properties
Inheritance is one of the key features for the success of object-oriented languages and can avoid re-verification of already proven properties and may thus substantially reduce the verification effort.
Constructive Trace Validation with Flat Temporal Logic Patterns
  • Computer Science
  • 2013
By restricting LTL formulas to flat, non-nested and right-associative forms, it is obtained a method which provides detailed explanations about the outcome of trace validation in a form comprehensible for the user.
On the freeze quantifier in constraint LTL: decidability and complexity


Comparing Linear and Branching Time Temporal Logics
  • C. Stirling
  • Philosophy
    Temporal Logic in Specification
  • 1987
This work proposes a general framework for modal and temporal logics and within it offer a formal criterion for distinguishing linear from branching logics, based on the CTL* framework.
Propositional Temporal Logics and Equivalences
Comparing propositional temporal logics is compared by comparing the equivalences that they induce on models and which of the induced equivalences are and which are not preserved under action refinement.
Three Logics for Branching Bisimulation (Extended Abstract)
Three temporal logics are introduced which induce on labelled transition systems the same identifications as branching bisimulation, and CTL* without the next-time operator interpreted over all paths, not just over maximal ones.
Three logics for branching bisimulation
Three temporal logics are introduced which induce on labeled transition systems the same identifications as branching bisimulation. The first is an extension of Hennessy-Milner logic with a kind of
Safety for Branching Time Semantics
It is shown that verifying safety properties on trees reduces to simulation testing and a safety preorder is proposed for this semantics based on simulation and dealing with silent actions.
What Good is Temporal Logic?
  • L. Lamport
  • Computer Science, Philosophy
    IFIP Congress
  • 1983
This was an invited paper. It describes the state of my views on specification and verification at the time. It is notable for introducing the idea of invariance under stuttering and explaining why
Concurrency and Automata on Infinite Sequences
  • D. Park
  • Computer Science
    Theoretical Computer Science
  • 1981
A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.
How Linear Can Branching-Time Be?
A new characterization that draws finer lines between branching-time and linear-time formulas of the logic CTL*, and it is proved that strong linearity implies sub-linearity which implies equi- linearity, each of which contains all LTL formulas.