Supervisor synthesis based on abstractions of nondeterministic automata
Authors:
- 1 January 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 412-418
Abstract
Blockingness is one of the major obstacles that need to be overcome in the Ramadge-Wonham supervisory synthesis paradigm, especially for systems of industrial size. Owing to the high computational complexity, synthesizing a nonblocking supervisor for a large scale system is never easy, if still possible. In this paper we attempt to solve this synthesis problem by using abstractions. We first introduce a new abstraction operation, which preserves the nonblocking property. Then we describe how to synthesize supervisors by using abstractions of relevant automata so that the high computational complexity associated with the synchronous product described in the Ramadge-Wonham supervisory control theory (SCT) may be avoided.Keywords
This publication has 18 references indexed in Scilit:
- A Small Model Theorem for Bisimilarity Control Under Partial ObservationIEEE Transactions on Automation Science and Engineering, 2007
- A Distributed Supervisor Synthesis Approach Based on Weak Bisimulation2006
- Computationally Efficient Supervisor Design: Abstraction and Modularity2006
- Nonblocking Supervisory Control of State Tree StructuresIEEE Transactions on Automatic Control, 2006
- Modular and decentralized supervisory control of concurrent discrete event systems using reduced system models2006
- On the Computation of Observers in Discrete-Event SystemsDiscrete Event Dynamic Systems, 2004
- Supervisory control using failure semantics and partial specificationsIEEE Transactions on Automatic Control, 1997
- Supervisory control of timed discrete-event systemsIEEE Transactions on Automatic Control, 1994
- Modular supervisory control of discrete-event systemsMathematics of Control, Signals, and Systems, 1988
- On the Supremal Controllable Sublanguage of a Given LanguageSIAM Journal on Control and Optimization, 1987