Compositional Synthesis of Maximally Permissive Supervisors Using Supervision Equivalence

Authors:
Hugo Flordal;Robi Malik;Martin Fabian;Knut Åkesson
Affiliations:
Department of Signals and Systems, Chalmers University of Technology, Göteborg, Sweden 41296;Department of Computer Science, University of Waikato, Hamilton, New Zealand;Department of Signals and Systems, Chalmers University of Technology, Göteborg, Sweden 41296;Department of Signals and Systems, Chalmers University of Technology, Göteborg, Sweden 41296
Venue:
Discrete Event Dynamic Systems
Year:
2007

Citing 0
Cited 4

Time-Optimal Coordination of Flexible Manufacturing Systems Using Deterministic Finite Automata and Mixed Integer Linear Programming

Discrete Event Dynamic Systems
Nonconflict check by using sequential automaton abstractions based on weak observation equivalence

Automatica (Journal of IFAC)
Maximally permissive coordinated distributed supervisory control of nondeterministic discrete-event systems

Automatica (Journal of IFAC)
Application of supervisory control theory to theme park vehicles

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

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.