Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Design and validation of computer protocols
Design and validation of computer protocols
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Condensed state spaces for symmetrical coloured Petri nets
Formal Methods in System Design - Special issue on symmetry in automatic verification
Exploiting symmetry in temporal logic model checking
Formal Methods in System Design - Special issue on symmetry in automatic verification
Formal Methods in System Design - Special issue on symmetry in automatic verification
Elements of ML programming (ML97 ed.)
Elements of ML programming (ML97 ed.)
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
An Analysis of Bitstate Hashing
Formal Methods in System Design
Saving Space by Fully Exploiting Invisible Transitions
Formal Methods in System Design
Symbolic Model Checking
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Space Efficient Reachability Analysis Through Use of Pseudo-Root States
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Design/CPN - A Computer Tool for Coloured Petri Nets
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Partial-Order Methods for Temporal Verification
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Analysing Bang & Olufsen's BeoLink® Audio/Video System Using Coloured Petri Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Finding Stubborn Sets of Coloured Petri Nets Without Unfolding
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Verification of a Revised WAP Wireless Transaction Protocol
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Bounded-memory Algorithms for Verification On-the-fly
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A Compositional Sweep-Line State Space Exploration Method
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Implementing Coloured Petri Nets Using a Functional Programming Language
Higher-Order and Symbolic Computation
Fast verification of the class of stop-and-wait protocols modelled by coloured Petri nets
Nordic Journal of Computing
Layered Duplicate Detection in External-Memory Model Checking
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
ASAP: An Extensible Platform for State Space Analysis
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Generating Petri net state spaces
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Worst-case execution time analysis for a Java processor
Software—Practice & Experience
Schedulability analysis using Uppaal: Herschel-Planck case study
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Search-order independent state caching
Transactions on Petri nets and other models of concurrency IV
Hybrid search algorithm to optimize scheduling problems for TCPN models
Proceedings of the 2010 Summer Computer Simulation Conference
Sweep-Line analysis of TCP connection management
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
State space exploration of object-based systems using equivalence reduction and the sweepline method
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A perspective on explicit state space exploration of coloured petri nets: past, present, and future
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
The sweep-line state space exploration method
Theoretical Computer Science
A graphical approach to component-based and extensible model checking platforms
Transactions on Petri Nets and Other Models of Concurrency V
Combining the sweep-line method with the use of an external-memory priority queue
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Hybrid on-the-fly LTL model checking with the sweep-line method
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
A Sweep-Line Method for Büchi Automata-based Model Checking
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
The recently developed sweep-line method exploits progress present in many concurrent systems to explore the full state space of the system while storing only small fragments of the state space in memory at a time. A disadvantage of the sweep-line method is that it relies on a monotone and global notion of progress. This prevents the method from being used for many reactive systems. In this paper we generalise the sweep-line method such that it can be used for verifying safety properties of reactive systems exhibiting local progress. The basic idea is to relax the monotone notion of progress and to recognise the situations where this could cause the state space exploration not to terminate. The generalised sweep-line method explores all reachable states of the system, but may explore a state several times. We demonstrate the practical application of the generalised sweep-line method on two case studies demonstrating a reduction in peak memory usage to typically 10 % compared to the use of ordinary full state spaces.