Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis

Blockingness is one of the major obstacles that need to be overcome in the Ramadge-Wonham supervisory synthesis paradigm, especially for large systems. In this paper, we propose an abstraction technique to overcome this difficulty. We first provide details of this abstraction technique, then describ...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2010-11, Vol.55 (11), p.2527-2541
Main Authors: Rong Su, van Schuppen, Jan H, Rooda, J E
Format: Article
Language:English
Subjects:
Alphabets
Applied sciences
Automata
Automata. Abstract machines. Turing machines
Automatic control
Automaton abstraction
Blocking
Computer science
control theory
systems
Control system synthesis
Control theory. Systems
discrete-event systems
Exact sciences and technology
Independent component analysis
Jacobian matrices
Markers
Mathematical models
Mechanical engineering
Modelling and identification
nondeterministic finite-state automata
Postal services
Specifications
supervisor synthesis
Supervisors
Supervisory control
Synthesis
Systems engineering and theory
Testing
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Blockingness is one of the major obstacles that need to be overcome in the Ramadge-Wonham supervisory synthesis paradigm, especially for large systems. In this paper, we propose an abstraction technique to overcome this difficulty. We first provide details of this abstraction technique, then describe how it can be applied to a supervisor synthesis problem, where plant models are nondeterministic but specifications and supervisors are deterministic. We show that a nonblocking supervisor for an abstraction of a plant under a specification is guaranteed to be a nonblocking supervisor of the original plant under the same specification. The reverse statement is also true, if we impose an additional constraint in the choice of the alphabet of abstraction, i.e., every event, which is either observable or labels a transition to a marker state, is contained in the alphabet of abstraction.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2010.2046931