Synthesis of Maximally-Permissive Supervisors for the Range Control Problem
Open Access
- 23 December 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 62 (8), 3914-3929
- https://doi.org/10.1109/tac.2016.2644867
Abstract
We investigate the supervisor synthesis problem for centralized partially-observed discrete event systems subject to safety specifications. It is well known that this problem does not have a unique supremal solution in general. Instead, there may be several incomparable locally maximal solutions. One then needs a mechanism to select one locally maximal solution. Our approach in this paper is to consider a lower bound specification on the controlled behavior, in addition to the upper bound for the safety specification. This leads to a generalized supervisory control problem called the range control problem. While the upper bound captures the (prefix-closed) legal behavior, the lower bound captures the (prefix-closed) minimum required behavior. We provide a synthesis algorithm that solves this problem by effectively constructing a maximally-permissive safe supervisor that contains the required lower bound behavior. This is the first algorithm with such properties, as previous works solve either the maximally-permissive safety problem (with no lower bound), or the lower bound containment problem (without maximal permissiveness).Keywords
Funding Information
- National Science Foundation (CCF-1138860)
- Expeditions in Computing project ExCAPE: Expeditions in Computer Augmented Program Engineering (CNS-1446298)
This publication has 28 references indexed in Scilit:
- Fault-Tolerant Control of Discrete-Event Systems with Lower-Bound SpecificationsIFAC-PapersOnLine, 2015
- Decentralized Control of Discrete-Event Systems With Multiple Local SpecificationsIEEE Transactions on Automation Science and Engineering, 2009
- Verification and Control of Hybrid SystemsPublished by Springer Science and Business Media LLC ,2009
- Effective computation of an Lm(G)-closed, controllable, and observable sublanguage arising in supervisory controlSystems & Control Letters, 2003
- Synthesis with Incomplete InformatioPublished by Springer Science and Business Media LLC ,2000
- Formulae relating controllability, observability, and co-observabilityAutomatica, 1998
- The infimal prefix-closed and observable superlanguange of a given languageSystems & Control Letters, 1990
- Decentralized control and coordination of discrete-event systems with partial observationIEEE Transactions on Automatic Control, 1990
- On observability of discrete-event systemsInformation Sciences, 1988
- Supervisory Control of a Class of Discrete Event ProcessesSIAM Journal on Control and Optimization, 1987