Aggregative Synthesis of Distributed Supervisors Based on Automaton Abstraction

@article{Su2010AggregativeSO,
  title={Aggregative Synthesis of Distributed Supervisors Based on Automaton Abstraction},
  author={Rong Su and Jan H. van Schuppen and J. E. Rooda},
  journal={IEEE Transactions on Automatic Control},
  year={2010},
  volume={55},
  pages={1627-1640}
}
Achieving nonblockingness in supervisory control imposes a major challenge when the number of states of a target system is large, often owing to synchronous product of many relatively small local components. To overcome this difficulty, in this paper we first present a distributed supervisory control problem, then provide an aggregative synthesis approach that computes nonblocking distributed supervisors. The key to the success of this approach is a newly developed automaton abstraction… 

Figures from this paper

Synthesize nonblocking distributed supervisors with coordinators

This work proposes a synthesis approach that computes nonblocking distributed supervisors with coordinators by using a novel automaton abstraction technique.

Coordinated distributed supervisory control

A coordinated distributed supervisor synthesis approach, where specifications are enforced by local supervisors, and coordinators are created based on automaton abstraction to avoid conflicting among local supervisors.

Maximum permissive coordinated distributed supervisory control of nondeterministic discrete-event systems

This work provides a sufficient condition, which guarantees the maximum permissiveness of the synthesized coordinated distributed supervisor, and shows that the problem of finding a coordinator with the minimum number of states is NP-hard.

Maximally permissive distributed supervisory control of nondeterministic discrete-event systems

This paper provides a sufficient condition, which guarantees maximal permissiveness of the synthesized distributed supervisor, and proposed automaton-based distributed synthesis approaches, in which the plant is modeled by a collection of nondeterministic finite-state automata.

Maximally permissive coordinated distributed supervisory control of nondeterministic discrete-event systems

Time optimal synthesis based upon sequential abstraction and maximizing parallelism

  • S. WareR. Su
  • Computer Science
    2017 13th IEEE Conference on Automation Science and Engineering (CASE)
  • 2017
This paper proposes an approach for finding a time optimal accepting trace for large discrete event systems based upon sequential language projection and is tested on a linear cluster tool to show their effectiveness.

Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis

It is shown that a nonblocking supervisor for an abstraction of a plant under a specification is guaranteed to be a non blocking supervisor of the original plant under the same specification.

Efficient Abstractions for the Supervisory Control of Modular Discrete Event Systems

It is shown, that an efficient abstraction technique, that was developed for the nonconflict verification of modular DES, is also suitable for thenonblocking supervisory control, and it is proved that this abstraction technique can be extended by the condition of local control consistency, in order to achieve maximally permissive supervision.

Compositional supervisor synthesis with state merging and transition removal

This working paper proposes a framework to obtain memory-efficient supervisors for large discrete event systems, which are least restrictive, controllable, and nonblocking and shows that supervisor maps can be computed efficiently and in many cases require less memory than automata-based supervisors.

A Framework for Compositional Synthesis of Modular Nonblocking Supervisors

The paper describes synthesis equivalent abstractions and shows their use in an algorithm to efficiently compute supervisors and successfully computes nonblocking modular supervisors, even for systems with more than 1014 reachable states, in less than 30 seconds.
...

References

SHOWING 1-10 OF 33 REFERENCES

Compositional Synthesis of Maximally Permissive Supervisors Using Supervision Equivalence

The proposed approach yields a compact representation of a least restrictive supervisor that ensures controllability and nonblocking, and is demonstrated on a simple manufacturing example to significantly reduce the number of states constructed for supervisor synthesis.

A Distributed Supervisor Synthesis Approach Based on Weak Bisimulation

  • R. SuJ. G. Thistle
  • Computer Science
    2006 8th International Workshop on Discrete Event Systems
  • 2006
A distributed supervisor synthesis approach is proposed, where instead of computing a model of the entire system, a local abstraction of the system with respect to each local component is computed based on weak bisimulation.

Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis

It is shown that a nonblocking supervisor for an abstraction of a plant under a specification is guaranteed to be a non blocking supervisor of the original plant under the same specification.

Yet another approach to compositional synthesis of discrete event systems

  • R. MalikH. Flordal
  • Mathematics
    2008 9th International Workshop on Discrete Event Systems
  • 2008
A two-pass algorithm for compositional synthesis of modular supervisors for large-scale systems of composed finite-state automata is proposed. The first pass provides an efficient method to determine

Modular supervisory control with equivalence-based conflict resolution

This paper proposes a set of requirements on coordinating filters that will resolve conflict among modular supervisors that implements deterministic coordinating filter control laws by nondeterministic automata.

Supervisor Reduction for Discrete-Event Systems

  • R. SuWalter Murray Wonham
  • Mathematics
    Discret. Event Dyn. Syst.
  • 2004
An algorithm is proposed which can significantly reduce supervisor size while preserving control action and it is shown that finding a supervisor of minimal size is NP-hard.

Modular Supervisory Control of Discrete-Event Systems with Abstraction and Incremental Hierarchical Construction

  • R. HillD. Tilbury
  • Mathematics
    2006 8th International Workshop on Discrete Event Systems
  • 2006
This paper addresses the problem of state explosion by outlining a procedure for incrementally building modular supervisors that are nonconflicting by construction. Abstractions are employed to make

Modular and decentralized supervisory control of concurrent discrete event systems using reduced system models

This paper investigates the supervisor synthesis for concurrent systems based on reduced system models with the intention of complexity reduction and provides sufficient conditions for the consistent implementation of the reduced supervisors for the original system.

On supervisor reduction in discrete-event systems

Abstract A supervisory controller (supervisor) S for a discrete-event system can be modelled on a recognizer R for the language corresponding to the supervisory task to be accomplished. It is shown

Supervisory control of discrete event systems