Monika Maidl  Home/Search
Context Related
| dcs.ed.ac.uk/~monika...maidlfocs.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: dcs.ed.ac.uk/~monika (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is well-known that CTL and LTL have incomparable expressive power. In this paper, we give an inductive definition of those ACTL formulas that can be expressed in LTL. In addition, we obtain a procedure to decide whether an ACTL formula lies in LTL, and show that this problem is PSPACE complete. By omitting path quantifiers, we get an inductive definition of the LTL formulas expressible in ACTL. We can show that the fragment defined by our logic represents exactly those LTL formulas the... (Update)
Context of citations to this paper: More
.... LTL model checking comes from a potential exponential blow up in the translation of into an automaton A: It is shown, however, in [70] that for LTL formulas that can also be expressed in 8CTL (the universal fragment of CTL) there is Buchi automaton A: whose size is...
...is that universal quanti cation of a state formula is decicable. The restrictions we impose on temporal operators are the same as in [Mai00a] where it was shown that under this restrictions, LTL and ACTL coincide. First order temporal logic is undecidable in general [SH88,...
Cited by: More
Witness and Counterexample Automata for ACTL - Meolic, Fantechi, Gnesi (2004) (Correct)
LTL Hierarchies and Model Checking - Pelánek (Correct)
Environment Synthesis for Compositional Model Checking - Peng, Mokhtari, Tahar (2002) (Correct)
Active bibliography (related documents): More All
0.3: Sometimes and Not Never Re-revisited: On Branching Versus Linear.. - Vardi (1998) (Correct)
0.2: Branching vs. Linear Time: Final Showdown - Vardi (2001) (Correct)
0.2: Fluent Model Checking for Event-based Systems - Giannakopoulou, Magee (2003) (Correct)
Similar documents based on text: More All
0.9: On ACTL Formulas Having Linear Counterexamples - Buccafurri, Eiter, Gottlob.. (2001) (Correct)
0.5: Model Checking CTL*[DC] - Pandya (Correct)
0.4: Verification of Concurrent Systems Using ACTL - Meolic, Kapus, Brezocnik (2000) (Correct)
Related documents from co-citation: More All
2: Temporal and modal logic (context) - Emerson - 1990
2: The complexity of propositional linear temporal logics (context) - Sistla, Clarke - 1985
2: The temporal logic of programs (context) - Pnueli - 1977
BibTeX entry: (Update)
Monika Maidl. The common fragment of CTL and LTL. In Proc. 41th Symp. on Foundations of Computer Science, pages 643--652, 2000. http://citeseer.ist.psu.edu/maidl00common.html More
@inproceedings{ maidl00common,
author = "Monika Maidl",
title = "The Common Fragment of {CTL} and {LTL}",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "643--652",
year = "2000",
url = "citeseer.ist.psu.edu/maidl00common.html" }
Citations (may not include all citations):779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1990
603 Kluwer Academic Publishers (context) - McMillan, Checking - 1993
539 The temporal logic of programs (context) - Pnueli - 1977 ACM DBLP
470 Design and Validation of Computer Protocols (context) - Holzmann - 1991 ACM
397 Design and synthesis of synchronization skeletons using bran.. (context) - Clarke, Emerson - 1981
267 Computer-Aided Verification of Coordinating Processes (context) - Kurshan - 1994 ACM
139 Reasoning about infinite computations - Vardi, Wolper - 1994 ACM DBLP
114 VIS: a system for verification and synthesis - Brayton, Hachtel et al. - 1996 DBLP
106 An algebraic definition of simulation between programs (context) - Milner - 1971 ACM DBLP
71 Reasoning about infinite computations paths (context) - Vardi, Wolper - 1983
66 Reasoning about networks with many identical finite-state pr.. (context) - Clarke, Grumberg et al. - 1986 ACM DBLP
59 Modalities for model checking: Branching time strikes back (context) - Emerson, Lei - 1985 DBLP
37 Module checking - Kupferman, Vardi - 1996 ACM DBLP
35 an and M. Y. Vardi. Freedom, weakness, and determinism: From.. (context) - Kupferm - 1998
26 Expressibility results for linear-time and branching-time lo.. (context) - Clarke, Draghicescu - 1988 ACM DBLP
16 Abstraction and Compositional Verification (context) - Long - 1993
16 The complexity of propositional temporal logic (context) - Sistla, Clarke - 1982
15 Relating linear and branching model checking - Kupferman, Vardi - 1996 ACM DBLP
14 the complexity of modular model checking - Vardi - 1995
8 branching time: A complexity-theoretic perspective (context) - Vardi - 1998
6 Modular specification and verification of reactive systems (context) - Josko - 1993
5 Simple onthe -fly automatic verification of linear temporal .. (context) - Gerth, Peled et al. - 1995
1 System Verification Based on Model Checking (context) - Maidl - 2000
1 Technical Report BRICS Autumn School on Verification (context) - Holzmann, of et al. - 1996
1 Temporal Verification of Reactive Systems: Specification (context) - Manna, Pnueli - 1992
Documents on the same site (http://www.dcs.ed.ac.uk/~monika): More
A Unifying Model Checking Approach for Safety Properties of.. - Maidl (2001) (Correct)
Using Model Checking for System Verification - Maidl (2000) (Correct)
Localizing Model Checking by Analyzing Transitions - Maidl (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