By Felisa J. Vázquez-Abad (auth.), R. Boel, G. Stremersch (eds.)

Discrete occasion structures: research and Control is the complaints of WODES2000 (the fifth Workshop on Discrete occasion structures, held in Ghent, Belgium, on August 21-23, 2000). This e-book presents a survey of the present cutting-edge within the box of modeling, research and regulate synthesis of discrete occasion platforms, lecture notes for a mini path on sensitivity research for functionality overview of timed discrete occasion platforms, and forty eight rigorously chosen papers masking all components of discrete occasion conception and an important functions domain names. issues comprise automata conception and supervisory regulate (12); Petri web established versions for discrete occasion platforms, and their keep an eye on synthesis (11); (max,+) and timed automata types (9); purposes papers relating to scheduling, failure detection, and implementation of supervisory controllers (7); formal description of PLCs (6); and eventually, stochastic versions of discrete occasion platforms (3).

Show description

Read Online or Download Discrete Event Systems: Analysis and Control PDF

Similar analysis books

Systems Analysis and Modeling in Defense: Development, Trends, and Issues

This e-book includes the lawsuits of an interna­ tional symposium dedicated to Modeling and research of security approaches within the context of land/air battle. It was once backed by way of Panel VII (on protection functions of Operational learn) of NATO's security learn workforce (DRG) and happened 27-29 July 1982 at NATO headquarters in Brussels.

Additional info for Discrete Event Systems: Analysis and Control

Example text

Abstraction by state fusion is fully detailed, two examples of abstraction by restriction are shown to be closely related to controller synthesis issues, also other restriction specifications such as attractivity, persistence, recurrence, ... can be dealt similarly. We refer to (Marchand and Le Borgne, 1999) and to a forthcoming report. The methods rely on intensional models for the systems, that for this article are taken to be dynamical equational systems over a finite field. Actually, results can be generalized to an enlarged class of models : the class of first order representable ones.

It should be clear that we are making only some very first and preliminary steps regarding the use of coalgebraic and coinductive techniques for the control of discrete event systems. Much remains to be done. One question is to investigate the 'algorithmic content' of the various definitions and proofs by coinduction. An example of another is to extend the present coalgebraic approach with (variations of) the notion of weak partial bisimulation and control relations, in order to deal with supervisory control with partial observations, and with hierarchical supervision.

Information and Computation, 98(2):142-170. , and Long, D. (1994). Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542. Clarke, E. , editors (1990). Proc. of the 2nd Work. on Computer-Aided Verification, LNCS 531. Springer-Verlag. , and Mc Millan, K. (1989). A language for compositional specification and verification of finite state hardware controllers. In Proc. of the 9th Int. Symp. on Computer Hardware Description Languages and Their Applications, pages 281-295.

Download PDF sample

Rated 4.29 of 5 – based on 42 votes