43,483 research outputs found
Observability and Decentralized Control of Fuzzy Discrete Event Systems
Fuzzy discrete event systems as a generalization of (crisp) discrete event
systems have been introduced in order that it is possible to effectively
represent uncertainty, imprecision, and vagueness arising from the dynamic of
systems. A fuzzy discrete event system has been modelled by a fuzzy automaton;
its behavior is described in terms of the fuzzy language generated by the
automaton. In this paper, we are concerned with the supervisory control problem
for fuzzy discrete event systems with partial observation. Observability,
normality, and co-observability of crisp languages are extended to fuzzy
languages. It is shown that the observability, together with controllability,
of the desired fuzzy language is a necessary and sufficient condition for the
existence of a partially observable fuzzy supervisor. When a decentralized
solution is desired, it is proved that there exist local fuzzy supervisors if
and only if the fuzzy language to be synthesized is controllable and
co-observable. Moreover, the infimal controllable and observable fuzzy
superlanguage, and the supremal controllable and normal fuzzy sublanguage are
also discussed. Simple examples are provided to illustrate the theoretical
development.Comment: 14 pages, 1 figure. to be published in the IEEE Transactions on Fuzzy
System
Synthesis of Covert Actuator Attackers for Free
In this paper, we shall formulate and address a problem of covert actuator
attacker synthesis for cyber-physical systems that are modelled by
discrete-event systems. We assume the actuator attacker partially observes the
execution of the closed-loop system and is able to modify each control command
issued by the supervisor on a specified attackable subset of controllable
events. We provide straightforward but in general exponential-time reductions,
due to the use of subset construction procedure, from the covert actuator
attacker synthesis problems to the Ramadge-Wonham supervisor synthesis
problems. It then follows that it is possible to use the many techniques and
tools already developed for solving the supervisor synthesis problem to solve
the covert actuator attacker synthesis problem for free. In particular, we show
that, if the attacker cannot attack unobservable events to the supervisor, then
the reductions can be carried out in polynomial time. We also provide a brief
discussion on some other conditions under which the exponential blowup in state
size can be avoided. Finally, we show how the reduction based synthesis
procedure can be extended for the synthesis of successful covert actuator
attackers that also eavesdrop the control commands issued by the supervisor.Comment: The paper has been accepted for the journal Discrete Event Dynamic
System
- …