| Alternate document: Details Relating Word and Tree Automata (96) Orna Kupferman Bell Laboratories Shmuel Safra Tel Aviv University Moshe Y. Vardi Rice University |
O. Kupferman, M.Y. Vardi  Home/Search
Context Related
| rice.edu/~vardi/pape...procomet98.ps.gz Cached: PS.gz PS 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.
Image Update HelpPS.gz PS PDF From: rice.edu/CS/Verification/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The difference in the complexity of branching and linear model checking has been viewed as an argument in favor of the branching paradigm. In particular, the computational advantage of CTL model checking over LTL model checking makes CTL a popular choice, leading to efficient model-checking tools for this logic. Can we use these tools in order to verify linear properties? In this paper we relate branching and linear model checking. With each LTL formula /, we associate a CTL formula /A that is... (Update)
Context of citations to this paper: More
...checkable than general B uchi automata. Hence the following corollary can be seen as a formalization of the presumption formulated in [12] that LTL formulas expressible in CTL can be checked (at least) as efficiently as CTL formulas even when using the automaton based...
Cited by: More
LTL Hierarchies and Model Checking - Pelánek (Correct)
Fair Equivalence Relations - Orna Kupferman And (Correct)
Search Techniques and Automata for Symbolic Model Checking - Bloem (2001) (Correct)
Similar documents (at the sentence level):
22.7%: Sometimes and Not Never Re-revisited: On Branching Versus Linear.. - Vardi (1998) (Correct)
7.4%: Modular Model Checking - Kupferman, Vardi (1998) (Correct)
5.6%: An Automata-Theoretic Approach to Modular Model Checking - Kupferman, Vardi (1998) (Correct)
Active bibliography (related documents): More All
0.4: Verification of Fair Transition Systems - Kupferman, Vardi (1996) (Correct)
0.4: Verification of Open Systems - Vardi (1997) (Correct)
0.4: Vacuity Detection in Temporal Model Checking - Kupferman, Vardi (1999) (Correct)
Similar documents based on text: More All
0.5: Synthesizing Dynamic Programming Algorithms from Linear.. - Rosu, Havelund (2001) (Correct)
0.5: Open Systems in Reactive Environments: Control and.. - Kupferman, Madhusudan, .. (2000) (Correct)
0.4: Some properties of CTL - Bauer (2001) (Correct)
Related documents from co-citation: More All
7: Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal .. (context) - Clarke, Emerson - 1981
7: The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
7: an and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branc.. (context) - Kupferm - 1998
BibTeX entry: (Update)
O. Kupferman and M. Y. Vardi. Relating linear and branching model checking. In Proc. IFIP Working Conference on Programming Concepts and Methods (PROCOMET'98), Shelter Island, NY, USA, June 1998. Chapman & Hall, 1998. To appear. http://citeseer.ist.psu.edu/kupferman96relating.html More
@techreport{ kupferman98relating,
author = "Orna Kupferman and Moshe Y. Vardi",
title = "Relating Linear and Branching Model Checking",
number = "TR98-301",
month = "18,",
pages = "20",
year = "1998",
url = "citeseer.ist.psu.edu/kupferman96relating.html" }
Citations (may not include all citations):1097 Automatic verification of finitestate concurrent systems usi.. (context) - Clarke, Emerson et al. - 1986
603 Kluwer Academic Publishers (context) - McMillan, checking - 1993
539 The temporal logic of programs (context) - Pnueli - 1977
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
397 Design and synthesis of synchronization skeletons using bran.. (context) - Clarke, Emerson - 1981
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
206 The model checker SPIN - Holzmann - 1997
170 Nondeterministic space is closed under complement - Immerman - 1988
142 A simple on-the-fly automatic verification for linear tempor.. - Gerth, Peled et al. - 1995
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
127 An automata-theoretic approach to branching-time model check.. - Bernholtz, Vardi et al. - 1994
120 Handbook of theoretical computer science (context) - Emerson, modal - 1990
114 The temporal semantics of concurrent programs (context) - Pnueli - 1981
106 An algebraic definition of simulation between programs (context) - Milner - 1971
102 Verification tools for finite-state concurrent systems - Clarke, Grumberg et al. - 1993
96 Finite automata and their decision problems (context) - Rabin, Scott - 1959
75 Modalities for model checking: Branching time logic strikes .. (context) - Emerson, Lei - 1985
54 Space-bounded reducibility among combinatorial problems (context) - Jones - 1975
53 Sometimes and not never revisited: On branching versus linea.. (context) - Emerson, Halpern - 1986
42 on Programming Languages and Systems (context) - Grumberg, Long et al. - 1994
39 Methodology and system for practical formal verification of .. - Beer, Ben-David et al. - 1994
37 the temporal logic of programs (context) - Lamport, sometimes et al. - 1980
37 Module checking - Kupferman, Vardi - 1996
26 the complexity of branching modular model checking (context) - Kupferman, Vardi - 1995
25 Deciding branching time logic (context) - Emerson, Sistla - 1984
20 Complexity of automata on infinite objects - Safra - 1989
19 get one free (context) - Kupferman, Grumberg - 1996
19 A unified approach for showing language containment and equi.. (context) - Clarke, Draghicescu et al. - 1993
17 Module checking revisited - Kupferman, Vardi - 1997
14 the complexity of modular model checking - Vardi - 1995
11 Not checking for closure under stuttering - Holzmann, Kupferman - 1996
4 CTL and equivalent sublanguages of CTL - Schneider - 1997
3 Private communication (context) - Clarke - 1997
3 The method of forced enumeration for nondeterministic automa.. (context) - Szelepcsinyi - 1988
1 Relating Linear and Branching Model Checking (context) - Long, abstraction et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/CS/Verification/): More
An Automata-Theoretic Approach to Branching-Time Model.. - Kupferman, Vardi, Wolper (1998) (Correct)
Computational Model Theory: An Overview - Vardi (1998) (Correct)
Bisimulation Minimization in an Automata-Theoretic.. - Fisler, Vardi (1998) (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