Efficient reachability analysis on modular discrete-event systems using binary decision diagrams

A well known strategy for handling the exponential complexity of modular discrete event systems is to represent the state space symbolically, using binary decision diagrams (BBDs). In this paper, key success factors in the design of efficient BDD-based reachability algorithms for synthesis and verification are discussed. It is also shown how the modular structure of a discrete event system (DES) can be utilized by taking advantage of the process communication graph and partitioning techniques. A reachability algorithm based on these principles is discussed and a proof of correctness for the algorithm is given.