Supervision of Infinite Behavior of Discrete-Event Systems

Thistle, J. G.; Wonham, W. M.

doi:10.1137/s0363012991217524

Cited by 71 publications

(75 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5) Construct a Büchi automaton controller satisfying . The first four steps have already been described in this paper and the fifth step has been extensively studied in the discrete-event systems literature [36], [64]- [66]. For the purposes of this paper we will simply assume the existence of defined in (5).…”

Section: Supervisory Synthesismentioning

confidence: 99%

“…Therefore, for any implementable Büchi automaton controller enforcing there exists a finite transition system satisfying . We refer the reader to [36], [64]- [66] for more details on the existence and computation of and return to Example 2.13. Example 4.4: Fig.…”

Section: Supervisory Synthesismentioning

confidence: 99%

“…Since we can also effectively compute from , it follows from standard results in supervisory control [36], [64]- [66] that it is decidable to determine the existence of a controller for and also that is effectively computable. The result now follows from the fact that steps (11) through (16) are effectively computable since the sets denoted by are semi-linear.…”

Section: Refining the Closed-loopmentioning

confidence: 99%

See 2 more Smart Citations

Linear Time Logic Control of Discrete-Time Linear Systems

Tabuada

Pappas

2006

IEEE Trans. Automat. Contr.

305

261

View full text Add to dashboard Cite

The control of complex systems poses new challenges that fall beyond the traditional methods of control theory. One of these challenges is given by the need to control, coordinate and synchronize the operation of several interacting submodules within a system. The desired objectives are no longer captured by usual control specifications such as stabilization or output regulation. Instead, we consider specifications given by linear temporal logic (LTL) formulas. We show that existence of controllers for discrete-time controllable linear systems and LTL specifications can be decided and that such controllers can be effectively computed. The closed-loop system is of hybrid nature, combining the original continuous dynamics with the automatically synthesized switching logic required to enforce the specification. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. Abstract-The control of complex systems poses new challenges that fall beyond the traditional methods of control theory. One of these challenges is given by the need to control, coordinate and synchronize the operation of several interacting submodules within a system. The desired objectives are no longer captured by usual control specifications such as stabilization or output regulation. Instead, we consider specifications given by linear temporal logic (LTL) formulas. We show that existence of controllers for discrete-time controllable linear systems and LTL specifications can be decided and that such controllers can be effectively computed. The closed-loop system is of hybrid nature, combining the original continuous dynamics with the automatically synthesized switching logic required to enforce the specification.

show abstract

Section: Supervisory Synthesismentioning

confidence: 99%

Section: Supervisory Synthesismentioning

confidence: 99%

Section: Refining the Closed-loopmentioning

confidence: 99%

See 1 more Smart Citation

Linear Time Logic Control of Discrete-Time Linear Systems

Tabuada

Pappas

2006

IEEE Trans. Automat. Contr.

305

261

View full text Add to dashboard Cite

show abstract

“…final states), which is a particular form of progress or liveness. An extension of the supervisory control theory taking liveness properties into full account was proposed in [17]. Two other types of general properties often expected from systems are security and conformance to specified service.…”

Section: Introductionmentioning

confidence: 99%

Supervisory Control for Modal Specifications of Services

Darondeau

Dubreil

Marchand

2010

IFAC Proceedings Volumes

View full text Add to dashboard Cite

In the service oriented architecture framework, a modal specification, as defined by Larsen in [6], formalises how a service should interact with its environment. More precisely, a modal specification determines the events that the server may or must allow at each stage in an interactive session. Therefore, techniques to enforce a modal specification on a system would be useful for practical applications. In this paper, we investigate the adaptation of the supervisory control theory of Ramadge and Wonham to enforce a modal specification (with final states marking the ends of the sessions) on a system modelled by a finite LTS. We prove that there exists at most one most permissive solution to this control problem. We also prove that this solution is regular and we present an algorithm for the effective computation of the corresponding controller.Key-words: discrete event systens, supervisory control, modal specifications, services, partial observation. Synthèse de contrôleurs pour des services décrits par des spécifications modalesRésumé : Dans le cadre d'une architecture orientée services, une spécification modale décrit les interactions possibles ou nécessaires entre un service et l'environnement utilisateur de ce service. Plus précisément, une spécification modale détermine les actions que le serveur peut ou doit permettreà son utilisateurà chaqueétape d'une session interactive. Développer des techniques de supervision permettant de forcer la conformité d'un systèmeà une spécification de service s'avère utile. Dans cet article, nous cherchonsà adapter les techniques de synthèse de contrôleurs afin de forcer la conformité de systèmes finisà des spécifications modales (avec desétats marquant les fins de sessions). Nous montrons que ce problème de contrôle a une plus grande solution. Nous montronségalement que cette solution est régulière et donnons un algorithme pour la calculer.

show abstract

“…An appropriate property--cocontrollability--is defined in Thistle and Wonham (1994b). 4 As in the finite-string case, a key step in infinite-string supervisor synthesis is the computation of the supremal controllable sublanguage of the legal language.…”

Section: Introductionmentioning

confidence: 99%

On control of systems modelled as deterministic Rabin automata

Thistle

1995

Discrete Event Dyn Syst

Self Cite

View full text Add to dashboard Cite

Abstract.Recent results on the control of infinite behaviour of finite automata are extended to allow Rabin acceptance conditions as modelling assumptions as well as specifications. The key result is a fixpoint characterization of the automaton's controllability subset--the set of states from which it can be controlled to the satisfaction of its associated specification. The fixpoint characterization allows for straightforward computation of the subset and for effective synthesis of controllers. The results have potential applications to supervisory control synthesis, the synthesis of reactive systems, and decision procedures for modal logics.

show abstract

Supervision of Infinite Behavior of Discrete-Event Systems

Cited by 71 publications

References 14 publications

Linear Time Logic Control of Discrete-Time Linear Systems

Linear Time Logic Control of Discrete-Time Linear Systems

Supervisory Control for Modal Specifications of Services

On control of systems modelled as deterministic Rabin automata

Contact Info

Product

Resources

About