Nonblocking supervisory control of state tree structures

It is well-known that the optimal nonblocking supervisory control problem is NP-hard, subject in particular to state space explosion that is exponential in the number of system components. This monograph proposes to manage complexity by organizing the system as a State Tree Structure (STS). STS are an adaptation of statecharts to Supervisory Control Theory. Based on STS an efficient recursive symbolic algorithm is presented that can perform nonblocking supervisory control design in reasonable time and memory for complex systems, with resulting tractable and highly comprehensible controllers. TOC:Introduction.- State Tree Structures: Basics.- Nonblocking Supervisory Control of State Tree Structures.- Symbolic Computation of State Tree Structures.- The Production Cell Example.- The AIP Example.- Conclusions and Future Research

Location
Deutsche Nationalbibliothek Frankfurt am Main
ISBN
9783540250692
3540250697
Dimensions
24 cm
Extent
XIII, 184 S.
Language
Englisch
Notes
graph. Darst.
Literaturangaben

Bibliographic citation
Lecture notes in control and information sciences ; Vol. 317

Classification
Informatik
Ingenieurwissenschaften und Maschinenbau
Keyword
Diskretes Ereignissystem
Prozessüberwachung
Kontrolltheorie
Zustandsgraph
Binäres Entscheidungsdiagramm
Berechnungskomplexität

Event
Veröffentlichung
(where)
Berlin, Heidelberg, New York
(who)
Springer
(when)
2005
Creator

Table of contents
Rights
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
Last update
11.06.2025, 2:22 PM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

Time of origin

  • 2005

Other Objects (12)