Distributed Control of Discrete-Event Systems: A First Step

Distributed control of discrete-event systems (DES) means control implemented by asynchronous message passing automata that can neither perform synchronized actions nor can read one another’s state. We explain some significant differences between this emerging area and earlier forms of control. Distributed control synthesis is challenging. To initiate a discussion on this topic, we outline a methodology based on the synthesis of distributable Petri nets (PN). The methodology is illustrated via a well-known example from distributed computing, the dining philosophers, for which three distributed solutions are produced. The paper provides a survey of DES control for PN researchers and a survey of distributed PN synthesis for DES researchers, with the intent to create a common basis for further investigation of this research track.

[1]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[2]  Leslie Lamport,et al.  Arbitration-free synchronization , 2003, Distributed Computing.

[3]  Stéphane Lafortune,et al.  Minimization of Communication of Event Occurrences in Acyclic Discrete Event Systems , 2008, IEEE Transactions on Automatic Control.

[4]  S. Ricker Asymptotic minimal communication for decentralized discrete-event control , 2008, 2008 9th International Workshop on Discrete Event Systems.

[5]  Walter Murray Wonham,et al.  Supervisor Localization: A Top-Down Approach to Distributed Control of Discrete-Event Systems , 2015, IEEE Transactions on Automatic Control.

[6]  Panos J. Antsaklis,et al.  Feedback control of Petri nets based on place invariants , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[7]  R. Kumar,et al.  Distributed state estimation in discrete event systems , 2009, 2009 American Control Conference.

[8]  Nidhal Rezg,et al.  Design of a live and maximally permissive Petri net controller using the theory of regions , 2003, IEEE Trans. Robotics Autom..

[9]  Alessandro Giua,et al.  Generalized mutual exclusion contraints on nets with uncontrollable transitions , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[10]  Anca Muscholl,et al.  Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata , 2010, ICALP.

[11]  W. Murray Wonham,et al.  Think Globally, Act Locally: Decentralized Supervisory Control , 1991, 1991 American Control Conference.

[12]  Xiaolan Xie,et al.  Algebraic and geometric characterization of Petri net controllers using the theory of regions , 2002, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings..

[13]  N. Chernikova Algorithm for finding a general formula for the non-negative solutions of a system of linear equations , 1964 .

[14]  Stéphane Lafortune,et al.  Minimal communication in a distributed discrete-event system , 2003, IEEE Trans. Autom. Control..

[15]  Pascal Raymond,et al.  The synchronous data flow programming language LUSTRE , 1991, Proc. IEEE.

[16]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[17]  John G. Thistle,et al.  Undecidability in decentralized supervision , 2005, Syst. Control. Lett..

[18]  Benoît Caillaud,et al.  Distributing Finite Automata Through Petri Net Synthesis , 2002, Formal Aspects of Computing.

[19]  Walter Murray Wonham,et al.  On observability of discrete-event systems , 1988, Inf. Sci..

[20]  Philippe Darondeau,et al.  Unbounded Petri Net Synthesis , 2003, Lectures on Concurrency and Petri Nets.

[21]  Wolfgang Reisig,et al.  Lectures on Concurrency and Petri Nets , 2003, Lecture Notes in Computer Science.

[22]  Sundar Sarukkai,et al.  FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings , 2005, FSTTCS.

[23]  P. Darondeau,et al.  Distributed implementations of Ramadge-Wonham supervisory control with Petri nets , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[24]  J. G. Thistle,et al.  Effective control synthesis for DES under partial observations , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[25]  P. S. Thiagarajan,et al.  The MSO Theory of Connectedly Communicating Processes , 2005, FSTTCS.

[26]  Amin Mannani,et al.  Decentralized Supervisory Control of Discrete-Event Systems Over Communication Networks , 2008, IEEE Transactions on Automatic Control.

[27]  Scott A. Mahlke,et al.  The theory of deadlock avoidance via discrete control , 2009, POPL '09.

[28]  M. P. Leonchuk,et al.  Numerical solution of a problem of optimum control of a nuclear reactor , 1965 .

[29]  Philippe Darondeau,et al.  Theory of Regions , 1996, Petri Nets.

[30]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[31]  Kunihiko Hiraishi On Solvability of a Decentralized Supervisory Control Problem With Communication , 2009, IEEE Transactions on Automatic Control.

[32]  Benoît Caillaud,et al.  Mind the gap: Expanding communication options in decentralized discrete-event control , 2007, 2007 46th IEEE Conference on Decision and Control.

[33]  N. Chernikova Brief communicationAlgorithm for finding a general formula for the non-negative solutions of a system of linear inequalities☆ , 1965 .

[34]  Benoît Caillaud,et al.  Correct-by-construction asynchronous implementation of modular synchronous specifications , 2005, Fifth International Conference on Application of Concurrency to System Design (ACSD'05).

[35]  Professor Dr. Wolfgang Reisig Elements of Distributed Algorithms , 1998, Springer Berlin Heidelberg.

[36]  Stéphane Lafortune,et al.  Decentralized supervisory control with communicating controllers , 2000, IEEE Trans. Autom. Control..

[37]  Thierry Massart,et al.  Synthesis of communicating controllers for distributed systems , 2011, IEEE Conference on Decision and Control and European Control Conference.

[38]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[39]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[40]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[41]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[42]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[43]  Leslie Lamport,et al.  Arbiter-Free Synchronization , 2003 .

[44]  P. Antsaklis,et al.  Reduced-order controllers for continuous and discrete-time singular H ∞ control problems based on LMI , 1996 .

[45]  Stéphane Lafortune,et al.  A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems , 2002, Discret. Event Dyn. Syst..