Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Formal Methods in System Design
Efficiently Mining Maximal Frequent Itemsets
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Assume-Guarantee Model Checking of Software: A Comparative Case Study
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Combining Partial Order Reductions with On-the-fly Model-Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Cluster-Based Partial-Order Reduction
Automated Software Engineering
Duplicate avoidance in depth-first search with applications to treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Test case generation for ultimately periodic paths
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Search-order independent state caching
Transactions on Petri nets and other models of concurrency IV
| Hi-index | 0.00 |
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optimizing the search may be crucial. We consider the problem of visiting all states in a graph where edges are generated by actions and the (reachable) states are not known in advance. Some of the actions may commute, i.e., they result in the same state for every order in which they are taken (this is the case when the actions are performed independently by different processes). We show how to use commutativity to achieve full coverage of the states while traversing considerably fewer edges.