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

Efficient Analysis of Large Discrete-Event Systems with Binary Decision Diagrams

Arash Vahidi (Institutionen för signaler och system, Automation) ; Bengt Lennartson (Institutionen för signaler och system, Automation) ; Martin Fabian (Institutionen för signaler och system, Automation)
Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on p. 2751 - 2756. (2005)
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Discrete-event systems, reachability search, supervisory control, symbolic computation

Denna post skapades 2006-04-27. Senast ändrad 2016-02-01.
CPL Pubid: 20008


Institutioner (Chalmers)

Institutionen för signaler och system, Automation



Chalmers infrastruktur