Branching vs. Linear Time: Final Showdown

@inproceedings{Vardi2001BranchingVL,
  title={Branching vs. Linear Time: Final Showdown},
  author={Moshe Y. Vardi},
  booktitle={TACAS},
  year={2001}
}
The discussion of the relative merits of linear- versus branching-time frameworks goes back to early 1980s. One of the beliefs dominating this discussion has been that "while specifying is easier in LTL (linear-temporal logic), verification is easier for CTL (branching-temporal logic)". Indeed, the restricted syntax of CTL limits its expressive power and many important behaviors (e.g., strong fairness) can not be specified in CTL. On the other hand, while model checking for CTL can be done in… 
CMPT 880 - Computational Logic Linear-time vs. Branching-time Logics
  • M. Memon
  • Computer Science, Philosophy
  • 2004
TLDR
Benefits and drawbacks of each paradigm are discussed in regards to complexity and expressiveness, in model checking and module checking, and it is concluded that there are situations where verification is better suited to a particular temporal framework.
Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications
TLDR
The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems.
Memoryful Branching-Time Logic
TLDR
It is shown that mCTL* is as expressive, but exponentially more succinct, than CTL*, and that the ability of m CTL* to refer to the present is essential for this equivalence.
Trace Semantics is Fully Abstract
TLDR
This work examines the branching-linear issue from the perspective of process equivalence, which is one of the most fundamental concepts in concurrency theory, as defining a notion of equivalence essentially amounts to defining semantics for processes.
Branching vs. Linear Time: Semantical Perspective
TLDR
This work examines the branching-linear issue from the perspective of process equivalence, which is one of the most fundamental notions in concurrency theory, and postulates three principles that are fundamental to any discussion ofprocess equivalence.
Knowledge , and Time : Alternating-time Temporal Epistemic Logic and its Applications
TLDR
The resulting logic — Alternating-time Temporal Epistemic Logic (atel) — shares the tractability of model checking with its atl parent, and is a succinct and expressive language for reasoning about game-like multiagent systems.
From Linear to Branching Time in Software Property Specifications
Software verification is a fundamental part of the software development process. Formal verification techniques, such as runtime-monitoring [4] and model checking [1], are based on formal
Synthesising Classic and Interval Temporal Logic
  • S. Schewe, Cong Tian
  • Computer Science
    2011 Eighteenth International Symposium on Temporal Representation and Reasoning
  • 2011
TLDR
The charm of this extension is that PL does not sacrifice the simplicity that makes its sub-logics attractive, and can, by subsuming both interval and classic temporal logics, synthesise both concepts to a common framework.
Temporal Logic and Fair Discrete Systems
TLDR
This chapter starts with Fair Discrete Structures, the model on which the truth and falsity of temporal logic formulas are evaluated, and introduces Propositional Linear Temporal Logic (LTL), a hybrid of LTL and CTL that combines the linear and branching views into one logic.
Logics for Mazurkiewicz traces
TLDR
A decision procedure for LTL over Mazurkiewicz traces is exhibited which generalizes the classical automata-theoretic approach to a linear temporal logic interpreted no longer over sequences but restricted labeled partial orders and applies a notion of independencerewriting to formulas of the logic.
...
...

References

SHOWING 1-10 OF 173 REFERENCES
Linear vs. branching time: a complexity-theoretic perspective
  • Moshe Y. Vardi
  • Computer Science
    Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
  • 1998
TLDR
It is shown that linear-time verification is not harder and often is even easier than branching- time verification in many scenarios, which suggests that the tradeoff between branching and linear time is not a simple tradeoffs between complexity and expressiveness.
Sometimes and Not Never Re-revisited: On Branching Versus Linear Time
TLDR
Two approaches that relate branching and linear model checking are described, one motivated by the fact that the alternation-free Μ-calculus, which is more expressive than CTL, has the same computational advantage as CTL when it comes to model checking.
Freedom, weakness, and determinism: from linear-time to branching-time
  • O. Kupferman, Moshe Y. Vardi
  • Computer Science, Mathematics
    Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
  • 1998
TLDR
This paper shows that a linear-time property can be specified in the alternation-free /spl mu/-calculus if it can be recognized by a deterministic Buchi automation, and describes the translation, when exists.
Relating linear and branching model checking
TLDR
This paper relates branching and linear model checking, and claims that, in practice, LTL model checkers perform nicely on formulas with equivalences of CTL, and often proceed essentially as the ones for CTL.
Temporal Logic with Fixed Points
TLDR
Although PTL is in this sense weak, the language is still attractive from a specification and verification standpoint; it is, after all, decidable.
Decision Procedures and Expressiveness in the Temporal Logic of Branching Time
TLDR
It is established that CTL has the small property by showing that any satisfiable CTL formulae is satisfiable in a small finite model obtained from a small -&-ldquo;pseudo-model-&-rdquo%; resulting from the Fischer Ladner quotient construction.
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
TLDR
A language, CTL*, in which a universal or existential path quantifier can prefix an arbitrary linear time assertion, is defined and the expressive power of a number of sublanguages is compared.
On-the-Fly Model Checking of RCTL Formulas
TLDR
It is shown that for every erroneous finite computation, there is an RCTL formula that detects it and can be verified on-the-fly and moved model checking in IBM into a different class of designs inaccessible by prior techniques.
The common fragment of CTL and LTL
  • M. Maidi
  • Computer Science
    Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
TLDR
An inductive definition of those ACTL (Action-based CTL) formulas that can be expressed in LTL is given, and it is shown that the fragment defined by the logic represents exactly those LTL formulas the negation of which can be represented by a 1-weak Bu/spl uml/chi automaton.
...
...