CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Efficient Application of Symbolic Tools for Resource Booking Problems

Arash Vahidi (Institutionen för signaler och system, Reglerteknik och automation) ; Bengt Lennartson (Institutionen för signaler och system, Reglerteknik och automation) ; Dennis Arkeryd (Institutionen för signaler och system, Reglerteknik och automation) ; Martin Fabian (Institutionen för signaler och system, Reglerteknik och automation)
American Control Conference, Arlington, VA, USA; 25 June through 27 June 2001 Vol. 6 (2001), p. 4937-4942.
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Binary decision diagrams; Controller synthesis; Discrete event systems; Flexible cells



Denna post skapades 2006-09-12. Senast ändrad 2016-02-01.
CPL Pubid: 15051

 

Institutioner (Chalmers)

Institutionen för signaler och system, Reglerteknik och automation (1900-2004)

Ämnesområden

Information Technology

Chalmers infrastruktur