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

Symbolic reachability computation using the disjunctive partitioning technique in Supervisory Control Theory

Zhennan Fei (Institutionen för signaler och system, Automation) ; Knut Åkesson (Institutionen för signaler och system, Automation) ; Bengt Lennartson (Institutionen för signaler och system, Automation)
2011 IEEE International Conference on Robotics and Automation (ICRA) (1050-4729). p. 4364 - 4369 . (2011)
[Konferensbidrag, refereegranskat]

Supervisory Control Theory (SCT) is a model-based framework for automatically synthesizing a supervisor that minimally restricts the behavior of a plant such that a given specification is fulfilled. A problem, which prevents SCT from having a major breakthrough industrially, is that the supervisory synthesis often suffers from the state-space explosion problem. To alleviate this problem, a well-known strategy is to represent and explore the state-space symbolically by using Binary Decision Diagrams. Based on this principle, an efficient symbolic state-space traversal approach, depending on the disjunctive partitioning technique, is presented and the correctness of it is proved. Finally, the efficiency of the presented approach is demonstrated on a set of benchmark examples.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-10-22. Senast ändrad 2015-01-16.
CPL Pubid: 147607

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

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


Institutioner (Chalmers)

Institutionen för signaler och system, Automation

Ämnesområden

Produktion
Reglerteknik
Produktionsteknik

Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:


On Symbolic Analysis of Discrete Event Systems Modeled as Automata with Variables