Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Partial Order Reduction in Symbolic State Space Exploration Department of Computer and Information Science

Summary: Partial Order Reduction in Symbolic State Space Exploration
R. Alur
Department of Computer and Information Science
University of Pennsylvania, Philadelphia, PA 19104
Email: alur@cis.upenn.edu
R.K. Brayton T.A. Henzinger S. Qadeer S.K. Rajamani
Department of Electrical Engineering and Computer Sciences
University of California at Berkeley, CA 94720
Email: fbrayton, tah, shaz, sriramrg@eecs.berkeley.edu
September 7, 1999
State space explosion is a fundamental obstacle in formal veri cation of designs and protocols.
Several techniques for combating this problem have emerged in the past few years, among which
two are signi cant: partial-order reductions and symbolic state space search. In asynchronous
systems, interleavings of independent concurrent events are equivalent, and only a representative
interleaving needs to be explored to verify local properties. Partial-order methods exploit this re-
dundancy and visit only a subset of the reachable states. Symbolic techniques, on the other hand,
capture the transition relation of a system and the set of reachable states as boolean functions.
In many cases, these functions can be represented compactly using binary decision diagrams
(BDDs). Traditionally, the two techniques have been practiced by two di erent schools|partial-


Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania


Collections: Computer Technologies and Information Sciences