On commutativity based Edge Lean search

Authors:
Dragan Bošnački;Edith Elkind;Blaise Genest;Doron Peled
Affiliations:
Department of Biomedical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB;Division of Mathematical Sciences, Nanyang Technological University, Singapore, Singapore;IRISA/CNRS, Rennes Cedex, France 35042;Department of Computer Science, Bar Ilan University, Ramat Gan, Israel 52900
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2009

Citing 7
Cited 0

A stubborn attack on state explosion

Formal Methods in System Design - Special issue on computer-aided verification: special methods I
State-space caching revisited

Formal Methods in System Design
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem

Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
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
Depth-first search and linear grajh algorithms

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of state space search is fundamental to many areas of computer science, such as, e.g., AI and formal methods. Often, the state space to be searched is huge, so optimizing the search is an important issue. In this paper, we consider the problem of visiting all states in the setting where transitions between states 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. We show how to use commutativity to achieve full coverage of the states, while traversing a relatively small number of edges.