Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
The Controllability Prefix for Supervisory Control under Partial Observation with an Application to Fault-Tolerant Control
Date
2017-07-01
Author
Moor, Thomas
Schmidt, Klaus Verner
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
154
views
0
downloads
Cite This
The controllability prefix is known as a useful concept for the discussion and solution of synthesis problems in supervisory control of cp-languages, i.e., formal languages of infinite-length words. There, the controllability prefix is defined as the set of all finite-length prefixes that can be controlled to satisfy prescribed liveness and safety properties. In this paper, we discuss a variation of the controllability prefix to address supervisory control under partial observation for regular *-languages, i.e., formal languages of finite-length words. We derive algebraic properties that are useful for a quantitative analysis on how an upper-bound language-inclusion specification affects achievable lower-bound specifications. Our study is motivated by the synthesis of fault-tolerant supervisory controllers, where the possible occurrence of a fault may restrict the achievable pre-fault behaviour so severe, that a relaxation of the upper-bound specification becomes a practical option. As our study shows, such a relaxation can be systematically constructed in terms of the controllability prefix. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
Subject Keywords
Partial observation
,
Fault-tolerant control
,
Supervisory control
,
Discrete-event systems
URI
https://hdl.handle.net/11511/37925
Journal
IFAC-PapersOnLine
DOI
https://doi.org/10.1016/j.ifacol.2017.08.2396
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
Maximally Permissive Hierarchical Control of Decentralized Discrete Event Systems
SCHMİDT, KLAUS WERNER; Schmidt, Klaus Verner (2011-04-01)
The subject of this paper is the synthesis of natural projections that serve as nonblocking and maximally permissive abstractions for the hierarchical and decentralized control of large-scale discrete event systems. To this end, existing concepts for nonblocking abstractions such as natural observers and marked string accepting (msa)-observers are extended by local control consistency (LCC) as a novel sufficient condition for maximal permissiveness. Furthermore, it is shown that, similar to the natural obse...
GENERATING EFFECTIVE INITIATION SETS FOR SUBGOAL-DRIVEN OPTIONS
DEMİR, ALPER; Cilden, Erkin; Polat, Faruk (World Scientific Pub Co Pte Lt, 2019-03-01)
Options framework is one of the prominent models serving as a basis to improve learning speed by means of temporal abstractions. An option is mainly composed of three elements: initiation set, option's local policy and termination condition. Although various attempts exist that focus on how to derive high-quality termination conditions for a given problem, the impact of initiation set generation is relatively unexplored. In this work, we propose an effective goal-oriented heuristic method to derive useful i...
The Need of a Semantic Layer between UMLS and Biomedical Information Systems
Özdemir, Birsen G.; Baykal, Nazife (2011)
Since biomedical information is scattered among a number of semantically or syntactically incompatible independent systems, a contemporary pragmatic approach is proposed in this study to make use of a semantic middle layer and common standards for information exchange between these systems. Biological and medical terminologies and ontologies take vital part in the background of life sciences information systems and the Unified Medical Language System (UMLS) is an inclusive source for biomedical vocabulary. ...
Applied supervisory control for a flexible manufacturing system
Moor, Thomas; Schmidt, Klaus Verner; Perk, Sebastian (2010-12-01)
This paper presents a case study in the design and implementation of a discrete event system (DES) of real-world complexity. Our DES plant is a flexible manufacturing system (FMS) laboratory model that consists of 29 interacting components and is controlled via 107 digital signals. Regarding controller design, we apply a hierarchical and decentralised synthesis method from earlier work in order to achieve nonblocking and safe closed-loop behaviour. Regarding implementation, we discuss how digital signals tr...
A Control System Architecture for Control of Non-Affine in Control, Open-Loop Unstable Underactuated Systems
Marangoz, Alp; Kutay, Ali Türker (2017-07-25)
In this paper, a control system architecture for control of non-affine in control, open-loop unstable underactuated system is discussed. Passivization of the unactuated (internal) system dynamics achieved through perturbation of trajectories of the actuated states, which are calculated through adaptive dynamic inversion technique, based on Tikhonov's theorem. Performance of the controller is shown through simulation of two open-loop unstable and locally uncontrollable example problems.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
T. Moor and K. V. Schmidt, “The Controllability Prefix for Supervisory Control under Partial Observation with an Application to Fault-Tolerant Control,”
IFAC-PapersOnLine
, pp. 13642–13647, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37925.