Efficient Application of Symbolic Tools for Resource Booking Problems
Paper in proceedings, 2001

This paper describes how symbolic model checking tools, like binary decision diagrams, may be used to analyze and synthesize supervisors for discrete event systems. As an application a general routing resource booking problem is considered. A specification language is presented which makes it easy to handle both multiple and alternative resource booking problems. The language is directly translated to a relational model, which is immediately implemented as a BDD. Two optimization concepts, namely smoothing and variable reduction in the BDD representation, are shown to be extremely valuable to handle huge state space problems in short time.

Controller synthesis

Flexible cells

Binary decision diagrams

Discrete event systems

Author

Arash Vahidi Mazinani

Chalmers, Signals and Systems, Control and Automation Laboratory

Bengt Lennartson

Chalmers, Signals and Systems, Control and Automation Laboratory

Dennis Arkeryd

Chalmers, Signals and Systems, Control and Automation Laboratory

Martin Fabian

Chalmers, Signals and Systems, Control and Automation Laboratory

American Control Conference, Arlington, VA, USA; 25 June through 27 June 2001

Vol. 6 4937-4942

Subject Categories

Computer and Information Science

More information

Created

10/7/2017