Supervisor Reduction for Discrete-Event Systems

Authors:
R. Su;W. M. Wonham
Affiliations:
Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario M5S 3G4, Canada surong@control.utoronto.ca;Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario M5S 3G4, Canada wonham@control.utoronto.ca
Venue:
Discrete Event Dynamic Systems
Year:
2004

Citing 8
Cited 9

Supervisory control of a class of discrete event processes

SIAM Journal on Control and Optimization
On the supermal controllable sublanguage of a given language

SIAM Journal on Control and Optimization
A new algorithm for the reduction of incompletely specified finite state machines

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Synthesis and Implementation of Local Modular Supervisory Control for a Manufacturing Cell

WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
Complexity reduction in discrete event systems

Complexity reduction in discrete event systems
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Verification and implementation of delay-insensitive processes in restrictive environments

Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
Designing communicating transaction processes by supervisory control theory

Formal Methods in System Design
Lose Fat, Not Muscle: An Examination of Supervisor Reduction in Discrete-Event Systems

Discrete Event Dynamic Systems
Towards synthesizing optimal coordination modules for distributed agents

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A dynamic programming approach to multi-level supervision

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Modular Supervisory Control with Equivalence-Based Abstraction and Covering-Based Conflict Resolution

Discrete Event Dynamic Systems
Decomposing controllers into non-conflicting distributed controllers

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Verification and Implementation of Delay-Insensitive Processes in Restrictive Environments

Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
Supervision localization of timed discrete-event systems

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In supervisory control theory (SCT) the supremal supervisor (representing the supremal controllable sublanguage) typically has a large state size (of order the product of state sizes of the plant and specification automata). In this paper, we propose an algorithm which can significantly reduce supervisor size while preserving control action. We also show that finding a supervisor of minimal size is NP-hard.