Moshe Y. Vardi  Home/Search
Context Related
Links: DBLP | rice.edu/~vardi/papers/etaps01.ps.gz rice.edu/~vardi/pa...taps01ver11.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: rice.edu/~vardi/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
Cooperation, Knowledge, and Time: Alternating-time.. - van der Hoek, Wooldridge (2003) (Correct)
Similar documents (at the sentence level): More
77.5%: Branching vs. Linear Time: Final Showdown - Moshe Vardi Rice (2001) (Correct)
17.6%: Linear vs. Branching Time: A Complexity-Theoretic Perspective - Vardi (1998) (Correct)
7.6%: Sometimes and Not Never Re-revisited: On Branching Versus Linear.. - Vardi (1998) (Correct)
Active bibliography (related documents): More All
0.7: Vacuity Detection in Temporal Model Checking - Kupferman, Vardi (1999) (Correct)
0.7: Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) (Correct)
0.7: The ForSpec Temporal Logic: A New Temporal.. - Armoni, Fix.. (2001) (Correct)
Similar documents based on text: More All
0.2: Taking Moore's Law Into the Next Century - Hamilton (1999) (Correct)
0.1: Extended Temporal Logic Revisited - Kupferman, Piterman, Vardi (2001) (Correct)
0.1: Another Look at LTL Model Checking - Clarke, Grumberg, Hamaguchi (1994) (Correct)
BibTeX entry: (Update)
Vardi, M. Y., `Branching vs. linear time: Final showdown', in T. Margaria and W. Yi, (eds.), Proceedings of the 2001. http://citeseer.ist.psu.edu/article/vardi01branching.html More
@article{ vardi01branching,
author = "Moshe Y. Vardi",
title = "Branching vs. Linear Time: Final Showdown",
journal = "Lecture Notes in Computer Science",
volume = "2031",
pages = "1--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/vardi01branching.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985 ACM DBLP
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986 ACM DBLP
828 Model Checking - Clarke, Grumberg et al. - 1999 ACM DBLP
779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1990
779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1992
625 ACM Transactions on Programming Languages and Systems (context) - Lamport, logic - 1994
603 Kluwer Academic Publishers (context) - McMillan, Checking - 1993
539 The temporal logic of programs (context) - Pnueli - 1977 ACM DBLP
502 Concurrency and automata on infinite sequences (context) - Park - 1981 ACM DBLP
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
357 Algebraic laws for nondeterminism and concurrency (context) - Hennessy, Milner - 1985 ACM DBLP
274 The existence of refinement mappings - Abadi, Lamport - 1991 ACM DBLP
267 Computer Aided Verification of Coordinating Processes (context) - Kurshan - 1994
230 Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
222 The complexity of propositional linear temporal logic (context) - Sistla, Clarke - 1985
221 Specification and verification of concurrent systems in Cesa.. (context) - Queille, Sifakis - 1981 ACM DBLP
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979 DBLP
194 the development of reactive systems (context) - Harel, Pnueli - 1985
177 Temporal logic can be more expressive (context) - Wolper - 1983 DBLP
165 Theoretical Computer Science (context) - Kozen, the et al. - 1983 ACM
163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
142 Simple on-the-fly automatic verification of linear temporal .. - Gerth, Peled et al. - 1995 ACM DBLP
139 Reasoning about infinite computations - Vardi, Wolper - 1994 ACM DBLP
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988 ACM DBLP
128 An automata-theoretic approach to linear temporal logic - Vardi - 1996 ACM DBLP
121 Compositional model checking - Clarke, Long et al. - 1989 ACM DBLP
120 Handbook of Theoretical Computer Science (context) - Emerson, modal - 1990 ACM
112 Memory efficient algorithms for the verification of temporal.. - Courcoubetis, Vardi et al. - 1992 ACM DBLP
110 the synthesis of a reactive module (context) - Pnueli, Rosner - 1989
108 Symbolic model checking using SAT procedures instead of BDDs - Biere, Cimatti et al. - 1999 ACM DBLP
106 An algebraic definition of simulation between programs (context) - Milner - 1971 ACM DBLP
103 The glory of the past (context) - Lichtenstein, Pnueli et al. - 1985 ACM DBLP
102 Verification tools for finite-state concurrent systems - Clarke, Grumberg et al. - 1993 ACM DBLP
90 Characterizing finite Kripke structures in propositional tem.. (context) - Browne, Clarke et al. - 1988 ACM DBLP
85 Special issue on Formal Methods in Software Practice (context) - Holzmann, checker et al. - 1997
84 Decision procedures and expressiveness in the temporal logic.. (context) - Emerson, Halpern - 1985 ACM DBLP
81 The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1987
81 Handbook of Theoretical Computer Science (context) - Thomas, infinite - 1990 ACM
78 Specification and design (context) - Jones - 1983
75 Modalities for model checking: Branching time logic strikes .. (context) - Emerson, Lei - 1985 DBLP
68 Specifying concurrent program modules (context) - Lamport - 1983 ACM DBLP
68 The anchored version of the temporal framework - Manna, Pnueli - 1989 ACM DBLP
67 Linear and branching structures in the semantics and logics .. (context) - Pnueli - 1985
66 A temporal fixpoint calculus (context) - Vardi - 1988 ACM DBLP
63 The temporal logic of branching time (context) - Ben-Ari, Pnueli et al. - 1983 ACM DBLP
58 Characterizing correctness properties of parallel programs u.. (context) - Emerson, Clarke - 1980 ACM DBLP
58 Model checking of safety properties - Kupferman, Vardi - 1999 ACM DBLP
57 High-density reachability analysis (context) - Ravi, Somenzi - 1995 ACM
56 Computer aided verification (context) - Clarke, Kurshan - 1986 ACM
53 Sometimes and not never revisited: On branching versus linea.. (context) - Emerson, Halpern - 1986
47 Generation of reduced models for checking fragments of CTL (context) - Dams, Grumberg et al. - 1993 ACM DBLP
46 Verification of an implementation of Tomasulo's algorithm by.. (context) - McMillan - 1998
46 Springer-Verlag (context) - Urquhart, Rescher - 1971
46 Proofs of networks of processes (context) - Misra, Chandy - 1981 DBLP
42 on Programming Languages and Systems (context) - Grumberg, Long et al. - 1994
40 Improved upper and lower bounds for modal logics of programs (context) - Vardi, Stockmeyer - 1985 ACM
40 Real-time programming and asynchronous message passing (context) - DeRoever, Koymans et al. - 1983 ACM DBLP
39 Weak alternating automata are not that weak - Kupferman, Vardi - 1997 ACM DBLP
39 Methodology and system for practical formal verification of .. - Beer, Ben-David et al. - 1994 ACM DBLP
37 Module checking - Kupferman, Vardi - 1996 ACM DBLP
37 the temporal logic of programs (context) - Lamport, sometimes et al. - 1980 ACM DBLP
36 Efficient generation of counterexamples and witnesses in sym.. - Clarke, Grumberg et al. - 1995 ACM DBLP
35 an and M.Y. Vardi. Freedom, weakness, and determinism: from .. (context) - Kupferm - 1998
34 Improved automata generation for linear temporal logic - Daniele, Guinchiglia et al. - 1999 ACM DBLP
31 the synthesis of an asynchronous reactive module (context) - Pnueli, Rosner - 1989
25 fly model checking for RCTL formulas - Beer, Ben-David et al. - 1998
24 Strong cyclic planning revisited - Daniele, Traverso et al. - 1999 ACM DBLP
24 Temporal logic with fixed points (context) - Banieqbal, Barringer - 1987 ACM DBLP
24 A combinatorial approach to the theory (context) - Thomas - 1981
23 Foundations of theory of specifications for distributed syst.. - Stark - 1984
23 What do message sequence charts means - Ladkin, Leue - 1994
20 Vacuity detection in temporal model checking - Kupferman, Vardi - 1999 ACM DBLP
17 Verifying the correctness of AADL modules using model chekci.. (context) - Josko - 1989
17 On combining formal and informal verification - Yuan, Shen et al. - 1997 ACM DBLP
17 Selective quantitative analysis and interval model checking:.. - Campos, Clarke et al. - 1996 DBLP
15 Relating linear and branching model checking - Kupferman, Vardi - 1998 ACM DBLP
15 Handbook of Theoretical Computer Science (context) - Kozen, Tiuryn et al. - 1990 ACM
14 FormalCheck User's Manual (context) - Kurshan - 1998
12 Testing language containment (context) - Touati, Brayton et al. - 1995
12 Handbook of Logic in Computer Science (context) - Stirling, temporal - 1992 ACM
11 Formal Equivalence Checking and Design Debugging (context) - Huang, Cheng - 1998 ACM
9 Temporal specification and verification of reactive modules - Manna, Pnueli - 1992
8 Hierarchical development of concurrent systems in a framewor.. (context) - Barringer, Kuiper - 1985
8 branching time: A complexity-theoretic perspective (context) - Vardi - 1998
8 Communication and Concurrecny (context) - Milner - 1989
8 An automata-theoretic approach to modular model checking - Kupferman, Vardi - 2000 ACM
8 An approach to the run-time monitoring of parallel programs - Cai, Turner - 1994 DBLP
7 Bisimulation minimization in an automata-theoretic verificat.. - Fisler, Vardi - 1998 ACM DBLP
5 Timing diagrams: Formalization and algorithmic verification - Fisler - 1999 DBLP
5 The common fragment of CTL and LTL - Maidl - 2000 ACM DBLP
5 The ForSpec compiler (context) - Armoni, Fix et al. - 2001
5 The ForSpec temporal language: A new temporal propertyspecif.. (context) - Armoni, Fix et al. - 2001
5 Model checking expands verification's scope (context) - Goering - 1997
4 Modular verification of Petri nets: the temporal logic appro.. (context) - Damm, Dohmen et al. - 1989 ACM DBLP
4 To appear in Information and Computation (context) - Kupferman, Vardi et al. - 2001
4 Formal verification made easy (context) - Schlipf, Buechner et al. - 1997 ACM
3 Sometimes and not never re-revisited: on branching vs - Vardi - 1998
2 Efficient decision prcedures for model checking of linear ti.. (context) - Bloem, Ravi et al. - 1999
1 Evaluating semi-exhausting verification techniques for bug h.. (context) - Fraer, Kamhi et al. - 1999
1 Oxford Univ (context) - Prior, Present - 1951
Documents on the same site (http://www.cs.rice.edu/~vardi/papers): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC