Synthesis of Run-To-Completion Controllers for Discrete Event Systems

@article{Alrahman2021SynthesisOR,
  title={Synthesis of Run-To-Completion Controllers for Discrete Event Systems},
  author={Yehia Abd Alrahman and V{\'i}ctor A. Braberman and Nicol{\'a}s D'Ippolito and Nir Piterman and Sebasti{\'a}n Uchitel},
  journal={2021 American Control Conference (ACC)},
  year={2021},
  pages={4892-4899}
}
A controller for a Discrete Event System must achieve its goals despite its environment being capable of resolving race conditions between controlled and uncontrolled events. Assuming that the controller loses all races is sometimes unrealistic. In many cases, a realistic assumption is that the controller sometimes wins races and is fast enough to perform multiple actions without being interrupted. However, in order to model this scenario using control of DES requires introducing foreign… Expand

Figures from this paper

References

SHOWING 1-10 OF 30 REFERENCES
On the relation between reactive synthesis and supervisory control of non-terminating processes
TLDR
A formal comparison is provided which allows to identify conditions under which one can solve one synthesis problem using methods from the other one and to derive formal problem statements and a characterisation of their solutions in terms of ω -languages. Expand
Control of Discrete Event Systems
TLDR
The main focus of this paper is the presentation of the automata and formal language model for DES introduced by Raniadge and Wonham in 1985, suitable for the examination of some important control theoretic issues, and provides a good basis for modular synthesis of controllers. Expand
Synthesis of event-based controllers for software engineering
TLDR
Evaluation of the techniques has been conducted using the tool to model known case studies from the literature, showing that by allowing more expressive controller goals and environment models, and explicitly distinguishing controllable and monitored actions such case studies can be more accurately modelled and solutions guaranteeing satisfaction of the goals can be achieved. Expand
Supervisory control and reactive synthesis: a comparative introduction
TLDR
A novel reduction of the basic supervisory control problem, non-blocking case, to a problem of reactive synthesis with plants and with a maximal permissiveness requirement is provided. Expand
Synchronous Programming of Reactive Systems
TLDR
This book presents a synthesis of recent works concerning reactive system design, based on Robin Milner's pioneering works about synchronous process algebras, which consists in considering that a program instantaneously reacts to events, or that the machine execution time is negligible with respect to the response delays of its environment. Expand
Temporal-Logic-Based Reactive Mission and Motion Planning
This paper provides a framework to automatically generate a hybrid controller that guarantees that the robot can achieve its task when a robot model, a class of admissible environments, and aExpand
Synthesizing cooperative reactive mission plans
By performing synthesis from formal high-level mission specifications, we can obtain robot controllers that are guaranteed to operate correctly under the specified environment conditions. SuchExpand
Fluent model checking for event-based systems
TLDR
An approach to model checking fluent-based linear-temporal logic properties, with its implementation and application in the LTSA tool and introduces "fluent" propositions that permit formulas to naturally express properties that combine state and action. Expand
Fluent temporal logic for discrete-time event-based models
TLDR
The paper extends fluent temporal logic with temporal operators for modelling timed properties of discrete-time event-based models and presents two approaches that differ on whether the properties model the system state after the occurrence of each event or at a fixed time rate. Expand
Synthesis of Reactive(1) Designs
TLDR
It is shown that for many expressive specifications of hardware designs the problem of synthesizing digital designs from their ltl specification can be solved in time N3, where N is the size of the state space of the design. Expand
...
1
2
3
...