Javier Esparza, Keijo Heljanko  Home/Search
Context Related
| informatik.unistuttgart.d...EH01.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: informatik.unistuttgart.de/fm... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We report on an implementation of the unfolding approach to model-checking LTL-X recently presented by the authors. Contrary to that work, we consider an state-based version of LTL-X, which is more used in practice. We improve on the checking algorithm; the new version allows to reuse code much more efficiently. We present results on a set of case studies. KEYWORDS: Net unfoldings, model checking, tableau systems, Petri nets, LTL Contents 1 (Update)
Cited by: More
Net Reductions for LTL Model-Checking - Esparza, Schröter (Correct)
LTL Model Checking for Modular Petri Nets - Latvala, Mäkelä (2004) (Correct)
Efficient Model Checking of Safety Properties - Latvala (2003) (Correct)
Similar documents (at the sentence level):
77.6%: Implementing LTL Model Checking with Net Unfoldings - Esparza, Heljanko (2002) (Correct)
9.8%: A New Unfolding Approach to LTL Model Checking - Esparza, Heljanko (2002) (Correct)
8.5%: Combining Symbolic and Partial Order Methods for Model Checking.. - Heljanko (2002) (Correct)
Active bibliography (related documents): More All
0.3: Bounded Reachability Checking with Process Semantics - Heljanko (2002) (Correct)
0.3: Model Checking with Finite Complete Prefixes Is PSPACE-complete - Heljanko (2002) (Correct)
0.2: Unfolding Based Algorithms for the Reachability Problem - Esparza, Schröter (2001) (Correct)
Similar documents based on text: More All
0.8: Deadlock And Reachability Checking With Finite Complete Prefixes - Heljanko (1999) (Correct)
0.5: Efficient Computer-Aided Verification of Parallel and Distributed .. - Mäkelä (2003) (Correct)
Related documents from co-citation: More All
8: A new unfolding approach to LTL model checking - Esparza, Heljanko - 2000
6: An automata-theoretic approach to linear temporal logic - Vardi - 1996
5: Using logic programs with stable model semantics to solve deadlock and reachabil.. - Heljanko - 1999
BibTeX entry: (Update)
J. Esparza and K. Heljanko. Implementing LTL Model Checking with Net Unfoldings. Accepted paper for SPIN'01, 2001. http://citeseer.ist.psu.edu/esparza01implementing.html More
@article{ esparza01implementing,
author = "Javier Esparza and Keijo Heljanko",
title = "Implementing {LTL} Model Checking with Net Unfoldings",
journal = "Lecture Notes in Computer Science",
volume = "2057",
pages = "37--??",
year = "2001",
url = "citeseer.ist.psu.edu/esparza01implementing.html" }
Citations (may not include all citations):603 Kluwer Academic Publishers (context) - McMillan, Checking - 1993
375 IEEE Transactions on Software Engineering (context) - Holzmann, checker - 1997
142 Simple on-the-fly automatic verification of linear temporal .. - Gerth, Peled et al. - 1995
128 An automata-theoretic approach to linear temporal logic - Vardi - 1996
112 Memoryefficient algorithms for the verification of temporal .. - Courcoubetis, Vardi et al. - 1992
103 Springer-Verlag (context) - Reisig, An - 1985
103 An improvement of McMillan's unfolding algorithm - Esparza, Rmer et al. - 1996
86 Evaluating deadlock detection methods for concurrent softwar.. - Corbett - 1995
68 Extending and Implementing the Stable Model Semantics - Simons - 2000
64 Formal Development of Reactive Systems: Case Study Productio.. (context) - Lewerentz, Lindner - 1995
56 fly verification with stubborn sets (context) - Valmari - 1993
47 Using logic programs with stable model semantics to solve de.. - Heljanko - 1999
33 Deadlock checking using net unfoldings - Melzer, Rmer - 1997
29 An unfolding algorithm for synchronous products of transitio.. - Esparza, Rmer - 1999
25 Model checking LTL using net unfoldings (context) - Wallner - 1998
19 A new unfolding approach to LTL model checking - Esparza, Heljanko - 2000
19 A new unfolding approach to LTL model checking - Esparza, Heljanko - 2000
11 An advanced tool for efficient reachability analysis - Varpaaniemi, Heljanko et al. - 1997
10 Petri net based qualitative analysis - A case study (context) - Heiner, Deussen - 1995
7 Reachability analysis using net unfoldings (context) - Esparza, Schrter - 2000
5 Deadlock and reachability checking with finite complete pref.. - Heljanko - 1999
3 Verification of fault tolerant algorithms using PEP - Merkel - 1973
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-stuttgart.de/fmi/szs/publications/esparza/): More
Simple Representative Instantiations for Multicast Protocols - Esparza, Maidl (2003) (Correct)
Reachability in Live and Safe Free-Choice Petri Nets is NP-complete - Esparza (1996) (Correct)
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (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