It can be shown that the problem of reliable transmission of data over an unreliable communication channel can be restated as a decentralized control problem of discrete-event systems. Necessary and su cient conditions for the existence of solutions to such decentralized supervisory control problems have been found. These conditions are used to verify the correctness of a protocol for the data ...

In this paper, we are interested in the control of Concurrent Discrete Event Systems defined by a collection of components that interact with each other. We investigate the computation of the supremal controllable language contained in the one of the specification. It is shown that by ensuring on the specification a new language property, called partial controllability condition with respect to...

Computer simulation of a system described by differential equations requires that some element of the system be approximated by discrete quantities. There are two system aspects that can be made discrete; time and state. When time is discrete, the differential equation is approximated by a difference equation (i.e., a discrete time system), and the solution is calculated at fixed points in time...

When dealing with real systems, it is unrealistic to suppose that observations can be totally ordered according to their emission dates. The partially ordered observations and the system are thus both represented as finite-state machines (or automata) and the diagnosis formally defined as the synchronized composition of the model with the observations. The problem we deal with in this paper is ...

In this paper we consider a class of Discrete-Event Dynamic Systems (DEDS) modeled as finite-state automata in which only some of the transition events are directly observed. An invertible DEDS is one for which it is possible to reconstruct the entire event string from the observation of the output string. The dynamics of invertibility are somewhat complex, as ambiguities in unobservable events...

To initiate a discussion on the modeling requirements for distributed control of discrete-event systems, a partially-automated regionbased methodology is presented. The methodology is illustrated via a well-known example from distributed computing: the dining philosophers. 1 Decentralized, Asynchronous, and Distributed DES Control In this section, we explain our understanding of the gradual evo...

Discrete event dynamic systems (DEDS) are treated in a mathematical framework using algebra and polynomials over finite fields. In this framework DEDS interacts with the environment by signals rather than events. The polynomial framework give symbolic representation of a DEDS behavior and canbe used formodeling, synthesis and verification. Two tools, Gröbner basis and binary decision diagrams, ...