Authors:
Tae-Sic Yoo,
Stéphane Lafortune,
Volume: 1, Page 1 Paper number 1321
Abstract:
We present new results on decentralized supervisory control of discrete-event
systems. We generalize the control architecture by allowing combinations
of ``fusion by intersection'' and ``fusion by union'' for the control
actions issued by the individual (local) supervisors. The algebraic
properties of co-observability in the context of this general architecture
are presented. We show that appropriate combinations of fusion rules
with corresponding decoupled local decision rules guarantee the safety
of the closed-loop behavior with respect to a given specification that
is not co-observable. We characterize an ``optimal'' combination of
fusion rules among those combinations guaranteeing the safety of the
closed-loop behavior. In addition, a simple supervisor synthesis technique
generating the infimal prefix-closed controllable and co-observable
superlanguage is presented.
Authors:
Shigemasa Takai,
Toshimitsu Ushio,
Volume: 1, Page 7 Paper number 9030
Abstract:
In this paper, we study decentralized supervisory control of discrete
event systems where local disabling actions are fused by the OR rule.
We generalize an on-line procedure for synthesizing decentralized supervisors
proposed by Prosser. In addition, we present lower bounds of the languages
generated by the closed loop systems.
Authors:
S. Laurie Ricker,
Karen Rudie,
Volume: 1, Page 9 Paper number 1414
Abstract:
An extension to a formal model for reasoning about knowledge and communication
in discrete-event systems is presented. The model is based on a modal
logic where propositions describe the knowledge that agents in the
system possess. Decentralized discrete-event control problems, where
agents must communicate in order to effect control, are examined. Previously
the identification of a state where agents should communicate was expressed
solely in terms of properties of a formal language. The updated knowledge
model presented here yields equivalent propositional logic expressions
so that agents can determine where to communicate based on their "knowledge"
of the system. The key relevant logic proposition corresponds to a
check on whether a group of agents, if they pooled their knowledge,
would possess sufficient information about the legality of a given
event sequence. The new formulation is applied to a previously-solved
example.
Authors:
Rene K. Boel,
Francisco J. Montoya,
Volume: 1, Page 16 Paper number 2046
Abstract:
This paper treats optimal scheduling in large timed discrete event
systems as a supervisory control problem. Scheduling tasks in a steel
plant is treated as a realistically sized case study. A sequence of
tasks must be completed as soon as possible, while satisfying all the
constraints in the model. These different constraints are specified
via different components in a modular plant representation. Components
can be represented as timed Petri nets, leading to a graph of interacting
modules. The acyclic nature of the graph consisting of the most critical
components is exploited in order to find a heuristic but fast way of
searching through the very large set of feasible orderings.
Authors:
Mohamed Hichem Lamouchi,
John G. Thistle,
Volume: 1, Page 22 Paper number 1748
Abstract:
A procedure is given for the effective solution of an infinite-string
supervisory control problem under partial observations, for the case
where the plant and specification languages are represented by finite
(omega)-automata (automata on infinite strings), and the observation
mask by a finite Moore automaton. This solves an (omega)-language
version of the standard centralized supervisory control problem under
partial observations. It is shown that a natural extension to decentralized
control is undecidable, even if the plant, the specification languages
and the masks are represented by finite automata. This undecidability
result carries over to the finite-string case.
Authors:
Gregory Provan,
Yi-Liang Chen,
Volume: 1, Page 29 Paper number 2120
Abstract:
This paper shows the relationship between two discrete event system
representations, finite state machines and causal networks. Finite
state machine models have been used extensively for the supervisory
control of logical (and timed, with some extension) discrete event
systems. On the other hand, Causal Networks have been applied mainly
to the diagnosis of discrete event systems. Recent advances in finite-state-machine-based
diagnosis and causal-network-based control have prompted an interest
in understanding the relationship between these two representations.
We describe initial findings concerning the mappings between these
two representations for modeling synchronous system components, and
discuss the implications of their relationships. We demonstrate the
relationship using an example of a factory conveyor system.
Authors:
Michael P. Spathopoulos,
Volume: 1, Page 35 Paper number 1684
Abstract:
We consider the problem of supervisory control for compact rectangular
automata with uniform rectangular activity i.e. initialised. The supervisory
controller is state feedback and can disable only discrete-event transitions
in order to solve the non-blocking forbidden state problem. The non-blocking
problem is defined under both strong and weak conditions.For the latter
maximally permissive solutions that are computable on a finite quotient
space characterised by language equivalence are derived.
|