The control and verification of similar agents operating in a broadcast network environment

We explore issues related to the control and verification of similar agents that interact through events broadcast over a network. The similar agents are modeled as discrete-event systems that have identical structure. System events are partitioned into global and private events that respectively affect all agents or exactly one agent. We show how the state explosion problem inherent to many concurrent systems is not as problematic in this setting. We give a procedure to test if these systems are globally deadlock-free or nonblocking. We explore control and verification problems related to both local and global specifications on these systems. For each module there is exactly one controller and all controllers enforce the same control policy. Necessary and sufficient conditions for achieving local and global specifications in this setting are identified.

[1]  M.H. de Queiroz,et al.  Modular control of composed systems , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[2]  Stéphane Lafortune,et al.  Design of nonblocking modular supervisors using event priority functions , 2000, IEEE Trans. Autom. Control..

[3]  Shengbing Jiang,et al.  Decentralized control of discrete event systems with specializations to local control and concurrent systems , 2000, IEEE Trans. Syst. Man Cybern. Part B.

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

[5]  Ryan J. Leduc,et al.  Hierarchical Interface-based Supervisory Control , 2003 .

[6]  W. M. Wonham,et al.  Decentralized control and coordination of discrete-event systems , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[7]  Walter Murray Wonham,et al.  Decentralized supervisory control of discrete-event systems , 1987, Inf. Sci..

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

[9]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[10]  David Harel,et al.  On the Complexity of Verifying Concurrent Transition Systems , 1997, Inf. Comput..

[11]  Walter Murray Wonham,et al.  On the complexity of supervisory control design in the RW framework , 2000, IEEE Trans. Syst. Man Cybern. Part B.

[12]  P. Ramadge,et al.  Modular Supervisory Control of Discrete Event Systems , 1988 .

[13]  P. Ramadge.  Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata , 1989 .

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

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

[16]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[17]  Stéphane Lafortune,et al.  Supervisor Existence for Modular Discrete-Event Systems , 2003 .

[18]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[19]  Mark Lawford,et al.  Hierarchical interface-based supervisory control: serial case , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[20]  Stéphane Lafortune,et al.  On the computational complexity of the verification of modular discrete-event systems , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[21]  Michael Heymann,et al.  Supervisory control of concurrent discrete-event systems , 1991 .

[22]  Stéphane Lafortune,et al.  Recent Results on Computational Issues in Supervisory Control , 1990 .

[23]  Walter Murray Wonham,et al.  Modular Control and Coordination of Discrete-Event Systems , 1998, Discret. Event Dyn. Syst..