Efficient Supervisory Synthesis of Large Systems
Journal article, 2006

Due to the state-space explosion, many synthesis and verification problems for discrete event systems cannot be solved using traditional state-space traversal algorithms. This work presents efficient methods for reachability search based on symbolic computations using Binary Decision Diagrams. In addition, simple guidelines and quantities for separating hard and easy reachability problems are presented. Furthermore, the performance of the presented algorithms and heuristics is demonstrated on a set of industrial benchmark examples. It is also shown that such examples are much more challenging than some well-known handmade benchmark models. This is also indicated by the presented hardness quantities.

Discrete event systems

Symbolic computation

Supervisory control

Reachability search

Binary decision diagrams

Author

Arash Vahidi Mazinani

Chalmers, Signals and Systems, Systems and control, Automation

Bengt Lennartson

Chalmers, Signals and Systems, Systems and control, Automation

Martin Fabian

Chalmers, Signals and Systems, Systems and control, Automation

Control Engineering Practice

0967-0661 (ISSN)

Vol. 14 10 1157-1167

Subject Categories

Electrical Engineering, Electronic Engineering, Information Engineering

DOI

10.1016/j.conengprac.2006.02.013

More information

Created

10/7/2017