Nonconflict check by using sequential automaton abstractions based on weak observation equivalence

Authors:
Rong Su;Jan H. van Schuppen;Jacobus E. Rooda;Albert T. Hofkamp
Affiliations:
Mechanical Engineering Department, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands;Centrum voor Wiskunde en Informatica (CWI), PO Box 94079, 1090 GB Amsterdam, The Netherlands;Mechanical Engineering Department, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands;Mechanical Engineering Department, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Automatica (Journal of IFAC)
Year:
2010

Citing 5
Cited 4

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
Operational and algebraic semantics of concurrent processes

Handbook of theoretical computer science (vol. B)
On the Computation of Observers in Discrete-Event Systems

Discrete Event Dynamic Systems
Compositional Synthesis of Maximally Permissive Supervisors Using Supervision Equivalence

Discrete Event Dynamic Systems

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

Automatica (Journal of IFAC)
Conflict-preserving abstraction of discrete event systems using annotated automata

Discrete Event Dynamic Systems
A process-algebraic semantics for generalised nonblocking

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
A process-algebraic semantics for generalised nonblocking

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Quantified Score

Hi-index	22.20

Visualization

Abstract

In Ramadge-Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by the composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant automata at each step, allowing the nonconflict check to be performed on relatively small automata, even though the original product system can be fairly large.