(Enter summary)
Abstract: The sweep-line method deletes states on-the-y during state
space exploration to reclaim memory and thereby reduce peak memory
usage. This deletion of states prohibits the immediate generation of, e.g.,
an error-trace when the violation of a safety property is detected. We address
this problem by combining the sweep-line method with storing a
spanning tree of the explored state space in external storage on a magnetic
disk. We show how this allows us to easily obtain paths in the state... (Update)
Cited by: More
Real-Time Model Checking on Secondary Storage - Stefan Edelkamp And
(Correct)
External Program Model Checking - Stefan Edelkamp Shahid
(Correct)
Parallel External Directed Model Checking with Linear I/O - Jabbar, Edelkamp (2006)
(Correct)
Active bibliography (related documents): More All
1.2: A Generalised Sweep-Line Method for Safety Properties - Kristensen, Mailund (2002)
(Correct)
0.9: Exploiting Equivalence Reduction and the.. - Billington.. (2004)
(Correct)
0.8: Sweep-Line State Space Exploration for Coloured Petri Nets - Gallasch, Kristensen.. (2002)
(Correct)
Similar documents based on text: More All
0.4: State Space Methods for Timed Coloured Petri Nets - Christensen, Jensen.. (2001)
(Correct)
0.4: A Compositional Sweep-Line State Space Exploration Method - Kristensen, Mailund (2002)
(Correct)
0.3: Analysing Infinite-State Systems by Combining Equivalence.. - Mailund (2002)
(Correct)
Related documents from co-citation: More All
4: Algorithms for Memory Hierarchies (context) - Meyer, Sanders et al. - 2003
4: Large-scale parallel breadth-first search (context) - Korf, Schultze - 2005
3: complexity of graph algorithms (context) - Kameshwar, Ranade et al. - 1999
BibTeX entry: (Update)
L. Kristensen and T. Mailund. Path finding with the sweep-line method using external storage. In International Conference on Formal Engineering Methods (ICFEM), pages 319--337, 2003. http://citeseer.ist.psu.edu/kristensen03path.html More
@misc{ kristensen03path,
author = "L. Kristensen and T. Mailund",
title = "Path finding with the sweep-line method using external storage",
text = "L. Kristensen and T. Mailund. Path finding with the sweep-line method using
external storage. In International Conference on Formal Engineering Methods
(ICFEM), pages 319--337, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/kristensen03path.html" }
Citations (may not include all citations):
1726
Graph Based Algorithms for Boolean Function Manipulation
- Bryant - 1986
828
Model Checking
- Clarke, Grumberg et al. - 1999
666
Theoretical Computer Science (context) - Alur, Dill et al. - 1994
603
Kluwer Academic Publishers (context) - McMillan, Checking - 1993
434
An Automata-Theoretic Approach to Automatic Program Veri cat.. (context) - Vardi, Wolper - 1986
216
Coloured Petri Nets - Basic Concepts (context) - Jensen - 1992
207
A Stubborn Attack on State Explosion (context) - Valmari - 1990
79
Elements of ML Programming (context) - Ullman - 1998
73
Prentice-Hall International Series in Computer Science (context) - Milner, Concurrency - 1989
68
One for All: On Model Checking Using Representatives (context) - Peled, One - 1993
50
State-Space Caching Revisited
- Godefroid, Holzmann et al. - 1995
50
Scheduling a Steel Plant with Timed Automata
- Fehnker - 1999
45
Reliable Hashing without Collision Detection
- Wolper, Leroy - 1993
43
Formal Methods in System Design (context) - Emerson, Sistla et al. - 1996
39
An Improved Protocol Reachability Analysis Technique
- Holzmann - 1988
35
The State Explosion Problem (context) - Valmari - 1998
28
Better Veri cation Through Symmetry (context) - Ip, Dill - 1996
28
Prentice-Hall International Editions (context) - Holzmann, Validation et al. - 1991
26
Formal Methods in System Design (context) - Holzmann, of - 1998
20
Condensed State Spaces for Symmetrical Coloured Petri Nets (context) - Jensen - 1996
19
A Sweep-Line Method for State Space Exploration
- Christensen, Kristensen et al. - 2001
19
Combining Partial Order and Symmetry Reduction
- Emerson, Jha et al. - 1997
19
The Practitioner's Guide to Coloured Petri Nets
- Kristensen, Christensen et al. - 1998
18
Stubborn Sets of Coloured Petri Nets (context) - Valmari - 1991
15
Exploiting Symmetries in Temporal Logic Model Checking (context) - Clarke, Filkorn et al. - 1993
13
A Generalised Sweep-Line Method for Safety Properties
- Kristensen, Mailund - 2002
12
Combining State Space Caching and Hash Compaction
- Stern, Dill - 1996
10
Bounded-memory Algorithms for Veri cation On-the- y (context) - Jard, Jeron - 1991
8
Using Magnetic Disk instead of Main Memory in the Murphi Ver..
- Stern, Dill - 1998
8
Veri cation of a Revised WAP Wireless Transaction Protocol (context) - Gordon, Kristensen et al. - 2002
8
Saving Space by Fully Exploiting Invisible Transitions (context) - Katz, Miller - 1999
7
Improved Probabilistic Veri cation by Hash Compaction (context) - Stern, Dill - 1995
6
A Compositional Sweep-Line State Space Exploration Method
- Kristensen, Mailund - 2002
6
A New Scheme for Memory-Ecient Probabilistic Veri cation (context) - Stern, Dill - 1996
3
volume 4 of EACTS Monographs on Theoretical Computer Science (context) - Reisig - 1985
2
Space Ecient Reachability Analysis through use of Pseudo-roo.. (context) - Parashkevov, Yantchev - 1997
1
Ecient Guiding Towards Cost-Optimaility in UPPAAL (context) - Behrmann, Fehnker et al. - 2001
1
Bell System Technical Journal (context) - Holzmann - 1985
1
Conformance Release (context) - Forum, Transaction et al. - 2000
http://www.daimi.au.dk/designCPN
www.wapforum.org/
Documents on the same site (http://www.daimi.au.dk/~mailund/publications.html): More
Coloured Petri Nets - A Tool in Software Engineering - Mailund (2000)
(Correct)
A Sweep-Line Method for State Space Exploration - Christensen, Kristensen, Mailund (2001)
(Correct)
State Space Methods for Timed Coloured Petri Nets - Christensen, Jensen.. (2001)
(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