Title
Compositional Synthesis of Maximally Permissive Supervisors Using Supervision Equivalence
Abstract
This paper presents a general framework for efficient synthesis of supervisors for discrete event systems. The approach is based on compositional minimisation, using concepts of process equivalence. In this context, a large number of ways are suggested how a finite-state automaton can be simplified such that the results of supervisor synthesis are preserved. The proposed approach yields a compact representation of a least restrictive supervisor that ensures controllability and nonblocking. The method is demonstrated on a simple manufacturing example to significantly reduce the number of states constructed for supervisor synthesis.
Year
DOI
Venue
2007
10.1007/s10626-007-0018-z
Discrete Event Dynamic Systems
Keywords
Field
DocType
Discrete event systems,Supervisory control,Finite state automata,Model reduction,Synthesis,Controllability,Nonblocking
Supervisor,Discrete mathematics,Permissive,Controllability,Supervisory control,Automaton,Finite-state machine,Equivalence (measure theory),Minimisation (psychology),Mathematics
Journal
Volume
Issue
ISSN
17
4
0924-6703
Citations 
PageRank 
References 
30
1.95
6
Authors
4
Name
Order
Citations
PageRank
Hugo Flordal1673.81
Robi Malik225326.13
Martin Fabian320427.91
Knut Åkesson430233.72