Communicating sequential processes
Communicating sequential processes
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Formal Methods in System Design
Condensed state spaces for symmetrical coloured Petri nets
Formal Methods in System Design - Special issue on symmetry in automatic verification
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
State minimization of finite state machines using implicit techniques
State minimization of finite state machines using implicit techniques
Elements of ML programming (ML97 ed.)
Elements of ML programming (ML97 ed.)
An Analysis of Bitstate Hashing
Formal Methods in System Design
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Communication and Concurrency
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
Improved probabilistic verification by hash compaction
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Using Magnatic Disk Instead of Main Memory in the Murphi Verifier
CAV '98 Proceedings of the 10th International Conference 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
Reliable Hashing without Collosion Detection
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
CPN tools for editing, simulating, and analysing coloured Petri nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
A nearly memory-optimal data structure for sets and mappings
SPIN'03 Proceedings of the 10th international conference 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
Search-order independent state caching
Transactions on Petri nets and other models of concurrency IV
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
Distributed LTL Model Checking with Hash Compaction
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state space is guaranteed. Each encountered state is mapped into a compressed state descriptor (hash value) as in hash compaction. The method additionally stores for each state an integer representing the identity of the state and a backedge to a predecessor state. This allows hash collisions to be resolved on-the-fly during state space exploration using backtracking to reconstruct the full state descriptors when required for comparison with newly encountered states. A prototype implementation of the ComBack method is used to evaluate the method on several example systems and compare its performance to related methods. The results show a reduction in memory usage at an acceptable cost in exploration time.