Conference Paper

A generalized approach to supervisor synthesis

Inst. for Comput. Design & Fault Tolerance, Karlsruhe Univ., Germany
DOI: 10.1109/MEMCOD.2003.1210106 Conference: Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings. First ACM and IEEE International Conference on
Source: DBLP

ABSTRACT We present a generalization of the supervisory control problem proposed by Ramadge and Wonham. The objective of that problem is to synthesize a controller, which constrains a system's behavior according to a given specification, ensuring controllability and co-accessibility. By introducing a new representation of the solution using systems of μ-calculus equations we are able to handle these two conditions separately and thus to exchange the co-accessibility requirement by any μ-calculus expression. Well-known results on the complexity of μ-calculus model checking allow us to easily assess the computational complexity of any generalization. As an example we solve the synthesis problem under consideration of fairness constraints.

Download full-text


Available from: Klaus Schneider, Aug 30, 2015
  • Source
    • "As a result, Sanchez's design procedures offer a more rigid specification interface than the generic translation algorithm proposed in this paper. Also related is the infinitary control synthesis research of Barbeau et al [20], and Ziller and Schneider [25]: With control requirements specified in metric temporal logic, Barbeau et al propose a method which composes a useful event-based automaton that realizes a controller satisfying these requirements, but which is not necessarily maximally permissive. Their method can be viewed as building the translation of temporal logic to automata directly into the control synthesis process. "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents and analyzes a correct and complete translation algorithm that converts a class of propositional linear-time temporal-logic (PTL) formulae to deterministic finite (-trace) automata. The translation algorithm is proposed as a specification interface for finitary control design of discrete-event systems (DESs). While there has been a lot of computer science research that connects PTL formulae to omega-automata, there is relatively little prior work that translates state-based PTL formulae in the context of a finite-state DES model, to event-based finite automata-the formalism on which well-established control synthesis methods exist. The proposed translation allows control requirements to be more easily described and understood in temporal logic, widely recognized as a useful specification language for its intuitively appealing operators that provide the natural-language expressiveness and readability needed to express and explain these requirements. Adding such a translation interface could therefore effectively combine specifiability and readability in temporal logic with prescriptiveness and computability in finite automata. The former temporal-logic features support specification while the latter automata features support the prescription of DES dynamics and algorithmic computations. A practical implementation of the interface has been developed, providing an enabling technology for writing readable control specifications in PTL that it translates for discrete-event control synthesis in deterministic finite automata. Two application examples illustrate the use of the proposed temporal-logic interface. Practical implications of the complexity of the translation algorithm are discussed.
    IEEE Transactions on Automation Science and Engineering 08/2007; DOI:10.1109/TASE.2006.881904 · 2.16 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Zusammenfassung In dieser Arbeit werden neue Erkenntnisse zur Modellierung und zur Spezifikation von Systemen mit diskreten Zustandsräumen vorgestellt. Ein automatisches Verfahren erlaubt es, unter Berücksichtigung verschiedener Systemeigenschaften, unerwünschte Zustände während der Modellierungsphase zu erken-nen und auszuschließen. Das Verfahren besteht aus einer Kombination der Überwachersynthese und der µ-Kalkül-basierten Modellprüfung. Die formale Darstellung der Systeme und deren Eigenschaften führt zu fehlerfreien Ergebnissen, vorausgesetzt, die informalen Angaben, aus denen die formale Eingabe ent-steht, wurden richtig interpretiert und in die formale Eingabe übersetzt. Den Entwicklern wird ein neues, vorteilhaftes Werkzeug zur Verfügung gestellt, das sich schrittweise in bestehende Verfahren integrieren lässt, ohne bisher praktizierte Entwicklungsprozesse zu beeinträchtigen.
  • Source
Show more