Efficient Reachability Analysis on Modular Discrete-Event Systems using Binary Decision Diagrams
Paper in proceedings, 2006

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.

Author

Martin Byröd

Chalmers, Signals and Systems, Systems and control, Automation

Bengt Lennartson

Chalmers, Signals and Systems, Systems and control, Automation

Arash Vahidi Mazinani

Chalmers, Signals and Systems, Systems and control, Automation

Knut Åkesson

Chalmers, Signals and Systems, Systems and control, Automation

8th International Workshop on Discrete Event Systems, WODES 2006; Ann Arbor, MI; United States; 10 July 2006 through 12 July 2006

288-293

Subject Categories

Computer and Information Science

DOI

10.1109/WODES.2006.1678444

ISBN

1424400538

More information

Created

10/7/2017