Branching processes of Petri nets
Acta Informatica
Handbook of logic in computer science (vol. 4)
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
The Book of Traces
Dynamic Bounds and Transition Merging for Local First Search
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An Unfolding Algorithm for Synchronous Products of Transition Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Local First Search - A New Paradigm for Partial Order Reductions
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Towards an Efficient Algorithm for Unfolding Petri Nets
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The Engineering of a Model Checker: The Gnu i-Protocol Case Study Revisited
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Categories of asynchronous systems
Categories of asynchronous systems
Dynamic Bounds and Transition Merging for Local First Search
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Stronger reduction criteria for local first search
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
The implementation of mazurkiewicz traces in POEM
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
McMillan's unfolding approach to the reachability problem in 1-safe Petri nets and its later improvements by Esparza-R枚mer-Vogler have proven in practice as a very effective method to avoid stateexplosion. This method computes a complete finite prefix of the infinite branching process of a net. On the other hand,the Local First Search approach (LFS) was recently introduced as a new partial order reduction technique which characterizes a restricted subset of configurations that need to be explored to check local properties. In this paper we amalgamate the two approaches: We combine the reduction criterion of LFS with the notions of an adequate order and cutoff events essential to the unfolding approach. As a result,our new LFS method computes a reduced transition system without the problem of state duplication (present in the original LFS). Since it works for any transition system with an independence relation,this black box partial unfolding remains more general than the unfolding of Petri nets. Experiments show that the combination gives improved reductions compared to the original LFS.