Blocking in Fully Connected Networks of Arbitrary Size

The problem of checking blocking properties is studied for networks consisting of arbitrary numbers of finite-state discrete-event subsystems. The topology of the networks is that of a fully connected graph: any subsystem can potentially interact with any other. Two types of blocking are studied: component blocking, whereby a subsystem is potentially prevented from entering its set of marker states, and network blocking, whereby the subsystems are potentially unable to occupy marker states simultaneously. It is shown that if the subsystems are all identical and broadcast actions are permitted, both types of blocking properties are undecidable; but in the absence of broadcast actions, they become decidable. If the subsystems are not necessarily identical but only isomorphic, then blocking properties are in general undecidable; however, a template is proposed for ensuring adequate structure for decidability. It is claimed that this template is sufficiently general to admit many realistic examples.

[1]  Helmut Veith,et al.  Verification by Network Decomposition , 2004, CONCUR.

[2]  Pierre Wolper,et al.  Verifying Properties of Large Sets of Processes with Network Invariants , 1990, Automatic Verification Methods for Finite State Systems.

[3]  Vineet Kahlon,et al.  Model Checking Large-Scale and Parameterized Resource Allocation Systems , 2002, TACAS.

[4]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[5]  J.G. Thistle,et al.  Analysis of Arbitrarily Large Networks of Discrete-Event Systems , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[6]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[7]  Vineet Kahlon,et al.  Reducing Model Checking of the Many to the Few , 2000, CADE.

[8]  E. A. Emerson,et al.  On Reasoning About Rings , 2003, Int. J. Found. Comput. Sci..

[9]  Robert P. Kurshan,et al.  A structural induction theorem for processes , 1989, PODC.

[10]  Edmund M. Clarke,et al.  Reasoning about Networks with Many Identical Finite State Processes , 1989, Inf. Comput..

[11]  Jules Desharnais,et al.  Control of Parameterized Discrete Event Systems , 2009, Discret. Event Dyn. Syst..

[12]  J. C. Martin,et al.  Introduction to Languages and the Theory of Computation" 3rd Ed , 1991 .

[13]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[14]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[15]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[16]  Edmund M. Clarke,et al.  Avoiding the state explosion problem in temporal logic model checking , 1987, PODC '87.

[17]  Alain Finkel,et al.  On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).