Control of Discrete-Event Systems: Automata and Petri Net by Jörg Raisch (auth.), Carla Seatzu, Manuel Silva, Jan H. van

By Jörg Raisch (auth.), Carla Seatzu, Manuel Silva, Jan H. van Schuppen (eds.)

Control of Discrete-event platforms presents a survey of crucial issues within the discrete-event structures thought with specific specialize in finite-state automata, Petri nets and max-plus algebra. assurance levels from introductory fabric at the uncomplicated notions and definitions of discrete-event platforms to more moderen effects. designated consciousness is given to effects on supervisory keep watch over, country estimation and fault prognosis of either centralized and distributed/decentralized platforms built within the framework of the disbursed Supervisory keep watch over of huge crops (DISC) undertaking. Later elements of the textual content are dedicated to the research of congested structures notwithstanding fluidization, an over approximation permitting a way more effective learn of remark and keep watch over difficulties of timed Petri nets. eventually, the max-plus algebraic method of the research and keep watch over of choice-free platforms is additionally thought of. keep an eye on of Discrete-event platforms offers an advent to discrete-event platforms for readers that aren't accustomed to this category of structures, but additionally offers an advent to analyze difficulties and open problems with present curiosity to readers already acquainted with them. lots of the fabric during this publication has been awarded in the course of a Ph.D. tuition held in Cagliari, Italy, in June 2011.

Show description

Read or Download Control of Discrete-Event Systems: Automata and Petri Net Perspectives PDF

Similar nonfiction_8 books

Advances in Object-Oriented Graphics I

Object-oriented platforms have won loads of recognition lately and their program to photographs has been very winning. This booklet records a few fresh advances and exhibits a variety of parts of present examine. the aim of the ebook is: - to illustrate the extreme functional software of object-oriented tools in special effects (including person interfaces, photograph synthesis, CAD), - to ascertain notable learn matters within the box of object-oriented pictures, and particularly to investi- gate extensions and shortcomings of the method whilst utilized to special effects.

Organizational Change and Information Systems: Working and Living Together in New Ways

This booklet examines quite a number matters rising from the interplay of data applied sciences and organizational platforms. It encompasses a number of learn papers targeting issues of growing to be curiosity within the box of knowledge platforms, association reviews, and administration. The e-book bargains a multidisciplinary view on info platforms aiming to disseminate educational wisdom.

Additional info for Control of Discrete-Event Systems: Automata and Petri Net Perspectives

Example text

8 (Decidability). A language L ⊆ Σ ∗ is decidable if and only if its characteristic function χL : Σ ∗ → {0, 1} is computable. We can now state the celebrated Church-Turing-Rosser Thesis. E VERYTHING COMPUTABLE CAN BE COMPUTED BY A TM. This thesis is not a claim about a mathematical object, and hence cannot have a proof. Instead, it postulates that the computability notion defined via the TM model is the “right” model. The reader willing to follow the thesis is therefore invited to continue with the remainder of the chapter.

IEEE Transactions on Automatic Control-Special Issue on Hybrid Systems 43(4), 569–573 (1998) 15. : Discrete abstractions of continuous systems–an Input/Output point of view. Mathematical and Computer Modelling of Dynamical Systems–Special Issue on Discrete Event Models of Continuous Systems 6, 6–29 (2000) 16. : Supervisory control of a class of discrete event systems. SIAM Journal of Control and Optimization 25, 206–230 (1987) 17. : The control of discrete event systems. Proceedings of the IEEE 77, 81–98 (1989) 18.

Repeating this exercise for other strings and using the realisation procedure described above, we obtain the NDFMoA P˜2 shown in Fig. 9. Its state set is Z˜ = Y ∪ U × Y 2 , its initial state set Z˜ 0 = Y . Note that only 8 out of the 10 elements of Z˜ are reachable. These are the initial states and states (u¯0 , y¯0 y¯1 ) such that (u¯0 %, y¯0 y¯1 ) ∈ B [0,1] . To avoid unnecessary cluttering of the figure, the output symbols are not indicated for each state, but summarily for all states generating the same output.

Download PDF sample

Rated 4.24 of 5 – based on 17 votes