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

Efficient Supervisory Synthesis of Large Systems

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)
Control Engineering Practice (0967-0661). Vol. 14 (2006), 10, p. 1157-1167.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: Discrete event systems, Reachability search, Supervisory control, Symbolic computation, Binary decision diagrams



Denna post skapades 2007-04-02. Senast ändrad 2016-02-01.
CPL Pubid: 40213

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för signaler och system, Automation

Ämnesområden

Elektroteknik och elektronik

Chalmers infrastruktur