Francois Laroussinie, Nicolas Markey, Philippe Schnoebelen  Home/Search
Context Related
| lsv.enscachan.fr/Pub...LMSlics2002.ps 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: lsv.enscachan....lisy32002.php (more) Homepages: N.Markey |
Rate this article:      (best)Comment on this article |
Abstract: We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL Past (which in turn can be more succinct than LTL). We study satisfiability and model checking for NLTL and provide optimal automata-theoretic algorithms for these EXPSPACE-complete problems. (Update)
Cited by: More
Shortest Counterexamples for Symbolic Model Checking of LTL.. - Schuppan, Biere (2005) (Correct)
Incremental and Complete Bounded Model Checking for Full.. - Heljanko, Junttila, Latvala (2005) (Correct)
LTL Hierarchies and Model Checking - Pelánek (Correct)
Active bibliography (related documents): More All
0.7: The Complexity of Temporal Logic Model Checking - Schnoebelen (2002) (Correct)
0.4: On Translating Linear Temporal Logic into Alternating and.. - Tauriainen (2003) (Correct)
0.3: A Dynamic Perspective on an Agent's Mental States and.. - Jonker, Treur (2002) (Correct)
Similar documents based on text: More All
1.1: Temporal Logic with Past is Exponentially More Succinct - Markey (2003) (Correct)
0.9: Past is for Free: on the Complexity of Verifying Linear Temporal.. - Markey (2002) (Correct)
0.8: Model checking CTL+ is hard - Laroussinie, Markey, Schnoebelen (2000) (Correct)
Related documents from co-citation: More All
8: The complexity of propositional linear temporal logics in simple cases - Demri, Schnoebelen - 1998
8: Model Checking - Clarke, Grumberg et al. - 1994
8: Temporal and modal logic (context) - Emerson - 1990
BibTeX entry: (Update)
F. Laroussinie, N. Markey, and Ph. Schnoebelen. Temporal logic with forgettable past. In Proc. 17th IEEE Symp. Logic in Computer Science (LICS'2002. http://citeseer.ist.psu.edu/laroussinie02temporal.html More
@misc{ lms-lics02,
author = "Francois Laroussinie and Nicolas Markey and Philippe Schnoebelen",
title = "Temporal Logic with Forgettable Past",
booktitle = "Proc. IEEE Symp. Logic in Computer Science (LICS'2002)",
year=2002,
url = "citeseer.ist.psu.edu/laroussinie02temporal.html" }
Citations (may not include all citations):1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
828 Model Checking - Clarke, Grumberg et al. - 1999
725 Temporal and modal logic (context) - Emerson - 1990
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
222 The complexity of propositional linear temporal logics (context) - Sistla, Clarke - 1985
163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
140 Tense Logic and the theory of linear order (context) - Kamp - 1968
103 The glory of the past (context) - Lichtenstein, Pnueli et al. - 1985
66 A temporal fixpoint calculus (context) - Vardi - 1988
56 Reasoning about the past with two-way automata - Vardi - 1998
51 The declarative past and imperative future: Executable tempo.. (context) - Gabbay - 1987
34 A decision algorithm for full propositional temporal logic - Kesten, Manna et al. - 1993
33 Information and Computation (context) - Laroussinie, Schnoebelen et al. - 2000
32 Algorithmics: The Spirit of Computing (context) - Harel - 1992
28 Computation tree logic CTL and path quantifiers in the monad.. (context) - Hafer, Thomas - 1987
27 The complexity of propositional linear temporal logics in si.. - Demri, Schnoebelen - 2002
26 First order logic with two variables and unary temporal logi.. - Etessami, Vardi et al. - 1997
25 A choppy logic (context) - Rosner, Pnueli - 1986
22 A hierarchy of temporal logics with past - Laroussinie, Schnoebelen - 1995
18 Model-Checking Techniques and Tools (context) - Brard, Bidoit et al. - 2001
16 Classifying discrete temporal properties - Wilke - 1999
15 Once and for all (context) - Kupferman, Pnueli - 1995
13 Alternating automata and program verification - Vardi - 1995
4 Extended temporal logic revisited - Kupferman, Piterman et al. - 2001
4 Process logic with regular formulas (context) - Harel, Peleg - 1985
3 The complementation problem for Bchi automata with applicati.. (context) - Sistla, Vardi et al. - 1987
1 Alternating finite automata on omega-words (context) - Miyano, Hayashi - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lsv.ens-cachan.fr/Publis/publis-y3-2002.php): More
On Verifying Fair Lossy Channel Systems - Masson, Schnoebelen (2002) (Correct)
Analysing the PGM Protocol with UPPAAL - Bérard, Bouyer, Petit (2002) (Correct)
Decidability of Strong Bisimilarity for Timed BPP - Lasota (2002) (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