2007
DOI: 10.1007/s10626-007-0018-z
|View full text |Cite
|
Sign up to set email alerts
|

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 demons… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

1
96
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
3
2
2

Relationship

3
4

Authors

Journals

citations
Cited by 69 publications
(97 citation statements)
references
References 14 publications
1
96
0
Order By: Relevance
“…Different methods have been developed that allow for an automatic synthesis of a supervisor. As computational complexity is high for systems of industrial size, several advanced techniques have been introduced to reduce synthesis complexity, such as modular [25], hierarchical [35], interface-based hierarchical [14], aggregative [11,17], distributed [9,13,32], coordinated distributed [29], and aggregated distributed [30]. They allow for splitting a system in a number of modules for which local supervisors can be synthesized.…”
Section: Synthesis-based Supervisory Control Engineeringmentioning
confidence: 99%
“…Different methods have been developed that allow for an automatic synthesis of a supervisor. As computational complexity is high for systems of industrial size, several advanced techniques have been introduced to reduce synthesis complexity, such as modular [25], hierarchical [35], interface-based hierarchical [14], aggregative [11,17], distributed [9,13,32], coordinated distributed [29], and aggregated distributed [30]. They allow for splitting a system in a number of modules for which local supervisors can be synthesized.…”
Section: Synthesis-based Supervisory Control Engineeringmentioning
confidence: 99%
“…One potential drawback of this approach is that the conditions for interface invariance may be too strong for many practical applications. In Flordal et al (2007) and Malik and Flordal (2008) compositional synthesis approaches are provided which aggregate component models one after another hoping that "bad" behaviors can be dropped out during the process of aggregation, instead of being kept to the last stage which usually results in extremely high complexity. Notable attentions should also be paid to some recent distributed synthesis approaches presented in e.g., Su and Thistle (2006), Feng and Wonham (2006), Hill et al (2008) and Su et al (2009Su et al ( , 2010a, which utilize (languagebased or automaton-based) model abstraction techniques when dealing with local synthesis.…”
Section: Supervisory Control Theorymentioning
confidence: 99%
“….. There are different ways of computing a supervisor such as monolithic [1], modular [25], and compositional [26] synthesis. In our approach we apply monolithic synthesis, which is performing fixed-point computations on the single composed automaton S 0 = P Sp.…”
Section: Supervisory Control Theorymentioning
confidence: 99%