Branching vs. linear time: Final showdown (2001) [42 citations — 4 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Vardi01branchingvs.,author = {Moshe Y. Vardi},
title = {Branching vs. linear time: Final showdown},
booktitle = {Proceedings of the 2001 Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2001 (LNCS Volume 2031},
year = {2001},
pages = {1--22},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Abstract:
Abstract. 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 time that is linear in the size of the specification, it takes time that is exponential in the specification for LTL. Because of these arguments, and for historical reasons, the dominant temporal specification language in industrial use is CTL. In this paper we argue that in spite of the phenomenal success of CTL-based model checking, CTL suffers from several fundamental limitations as a specification language, all stemming from the fact that CTL is a branching-time formalism: the language is unintuitive and hard to use, it does not lend itself to compositional reasoning, and it is fundamentally incompatible with semi-formal verification. These inherent limitations severely impede the functionality of CTL-based model checkers. In contrast,
Citations
| 368 | The Existence of Refinement Mappings – Abadi, Lamport - 1991 |
| 242 | Alternating-Time Temporal Logic – Alur, Henzinger, et al. - 1998 |
| 51 | Model checking of hierarchical state machines – Alur, Yannakakis - 1998 |
| 48 | The ForSpec temporal logic: A new temporal property-specification language – Armoni, Fix, et al. - 2002 |
| 34 | Methodology and system for practical formal verification of reactive hardware – Beer, Ben-David, et al. |
| 27 | On-the-fly model checking of RCTL formulas – Beer, Ben-David, et al. - 1998 |
| 24 | On-the-fly model checking of RCTL formulas – Beer, Ben-David, et al. - 1998 |
| 23 | Temporal logic with fixed points – Banieqbal, Barringer - 1987 |
| 6 | Hierarchical development of concurrent systems in a framework – Barringer, Kuiper - 1985 |
| 5 | The ForSpec temporal language: A new temporal property-specification language – Armoni, Fix, et al. - 2002 |
| 4 | The ForSpec compiler – Armoni, Fix, et al. - 2001 |
