Thomas Mailund June 7, 2002 We examine the combination of the sweep-line...  Home/Search
Context
Related
| daimi.au.dk/~mailu...sweep_and_equiv.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: daimi.au.dk/~mailund/technotes (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we will examine the combination of equivalence reduction and the sweep-line method, when the progress measure from the sweep-line method is compatible with the equivalence relation used in the equivalence reduction. This di ers signi cantly from the method described in [12] where the two techniques are also combined but where the progress measure, by the nature of the systems considered necessarily is not compatible with the equivalence relation (Update)
Active bibliography (related documents): More All
1.0: Exploiting Equivalence Reduction and the.. - Billington.. (2004) (Correct)
0.6: Sweep-Line State Space Exploration for Coloured Petri Nets - Gallasch, Kristensen.. (2002) (Correct)
0.5: A Probabilistic Cut-off Technique - Mailund (2002) (Correct)
Similar documents based on text: More All
0.5: The Second Annual Video Review of Computational Geometry - Brown, (eds.) (Correct)
0.4: Analysing Infinite-State Systems by Combining Equivalence.. - Mailund (2002) (Correct)
0.4: State Space Methods for Timed Coloured Petri Nets - Christensen, Jensen.. (2001) (Correct)
BibTeX entry: (Update)
@misc{ june-combining,
author = "Thomas Mailund June",
title = "On Combining the Sweep-Line and Equivalence Method",
url = "citeseer.ist.psu.edu/654101.html" }
Citations (may not include all citations):216 Coloured Petri Nets - Basic Concepts (context) - Jensen - 1994
207 A Stubborn Attack on State Explosion (context) - Valmari - 1990
68 One for All: On Model Checking Using Representatives (context) - Peled, One - 1993
50 State-Space Caching Revisited - Godefroid, Holzmann et al. - 1995
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
26 Formal Methods in System Design (context) - of, Hashing - 1998
19 A Sweep-Line Method for State Space Exploration - Christensen, Kristensen et al. - 2031
17 Partial Order Methods for Temporal Veri cation (context) - Wolper, Godefroid - 1993
15 Exploiting Symmetries in Temporal Logic Model Checking (context) - Clarke, Enders et al. - 1996
13 A Generalised Sweep-Line Method for Safety Properties - Kristensen, Mailund - 2002
7 Improved Probabilistic Veri cation by Hash Compaction (context) - Stern, Dill - 1995
5 State Space Methods for Timed Coloured Petri Nets - Christensen, Jensen et al. - 2001
3 Formal Methods in System Design (context) - Spaces, Coloured et al. - 1996
3 Analysing In nite-State Systems by Combining Equivalence Red.. (context) - Mailund - 2002
1 Bounded-memory Algorithms for Veri cation Onthe - y (context) - Jard, Jeron - 1991
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