Thomas Mailund  Home/Search
Context
Related
| daimi.au.dk/~mailu...sticreduction.pdf 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: daimi.au.dk/~mailund/technotes (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: INTRODUCTION We are often interested in finding out if a given predicate on states of a system can be satisfied in any or all of the systems reachable states. To determine this, one approach is to calculate the complete set of reachable states and evaluate the predicate on each of these states. To know which states we have already examined and which we have yet to examine---and thus knowing when we have examined all states---we store the examined states in a table. The major problem with this ... (Update)
Active bibliography (related documents): More All
0.2: Obtaining Memory-Efficient Reachability Graph.. - Mailund, Westergaard (2004) (Correct)
0.1: Exploiting Equivalence Reduction and the.. - Billington.. (2004) (Correct)
0.1: Efficiency Issues in the Design of a Model Checker - Geldenhuys (1999) (Correct)
Similar documents based on text: More All
0.1: Analysing Infinite-State Systems by Combining Equivalence.. - Mailund (2002) (Correct)
0.1: Equivalence Based Cut-off in the Sweep-Line Method - Mailund (2001) (Correct)
0.1: Textual Interchange Format for High-level Petri Nets - Lyngsų, Mailund (1998) (Correct)
BibTeX entry: (Update)
@misc{ mailund-simple,
author = "Thomas Mailund",
title = "A Simple State-Space Reduction Method",
url = "citeseer.ist.psu.edu/mailund04simple.html" }
Citations (may not include all citations):207 A Stubborn Attack on State Explosion (context) - Valmari - 1990
135 Partial-Order Methods for the Verification of Concurrent Sys.. - Godefroid - 1996
50 State-Space Caching Revisited - Godefroid, Holzmann et al. - 1995
43 Formal Methods in System Design (context) - Emerson, Sistla et al. - 1996
26 Formal Methods in System Design (context) - of, Hashing - 1998
20 State Compression in SPIN: Recursive Indexing and Compressio.. - Holzmann - 1997
19 A Sweep-Line Method for State Space Exploration - Christensen, Kristensen et al. - 2001
18 Symmetry Reductions in Model Checking (context) - Clake, Emerson et al. - 1998
15 Improved Probabilistic Verification by Hash Compaction - Stern, Dill - 1995
14 A Minimized Automaton Representation of Reachable States - Puri, Holzmann - 1999
Documents on the same site (http://www.daimi.au.dk/~mailund/technotes.html): More
On Garbage Collection in SweepChecker - Mailund (2002) (Correct)
Equivalence Based Cut-off in the Sweep-Line Method - Mailund (2001) (Correct)
On the Complexity of the Sweep-Line Method - Mailund (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