Efficient Analysis of Large Discrete-Event Systems with Binary Decision Diagrams
Arash Vahidi, Bengt Lennartson, Martin Fabian · 2006
Efficient analysis and controller synthesis in the context of Discrete-Event Systems (DES) is discussed in this paper. We consider efficient reachability search for solving common problems in the Supervisory Control Theory (SCT). The search is based on symbolic computations including crucial partitioning techniques. Finally, the efficiency of the presented algorithms is demonstrated on a set of hand-made and real-world industrial systems.