Weak Invariant Simulation and Its Application to Analysis of Parameterized Networks

Multi-process networks figure in many engineering applications. Parameterized discrete event systems provide a convenient means of modeling such networks when the number of subprocesses is arbitrary, unknown or time-varying. Unfortunately, some key properties of these networks, such as nonblocking and deadlock-freedom, are undecidable. Moreover, mathematical tools supporting analysis of these networks are limited. This paper introduces a novel mathematical notion, weak invariant simulation, which is adapted to the analysis of synchronous products of discrete event systems. Furthermore, it proposes an efficient method to check whether a finite-state generator weakly invariantly simulates another finite-state generator with respect to a specific subalphabet. This new simulation relation is used to define a tractable subclass of parameterized ring networks of isomorphic subprocesses in which deadlock-freedom is decidable. Within this framework, a procedure is given to determine the reachable deadlocked states of the network. The effectiveness of the procedure is demonstrated by the deadlock analysis of a version of the dining philosophers problem.

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

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

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

[4]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[5]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[6]  Vineet Kahlon,et al.  Parameterized Model Checking of Ring-Based Message Passing Systems , 2004, CSL.

[7]  Walter Murray Wonham.  Supervisory Control of Discrete-Event Systems , 2015, Encyclopedia of Systems and Control.

[8]  John G. Thistle,et al.  Invariant weak simulation and analysis of parameterized networks , 2012, 2012 American Control Conference (ACC).

[9]  Thomas A. Henzinger,et al.  Temporal Proof Methodologies for Timed Transition Systems , 1994, Inf. Comput..

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

[11]  Bas Luttik,et al.  Computation Tree Logic with Deadlock Detection , 2009, Log. Methods Comput. Sci..

[12]  Y. Narahari,et al.  Deadlock prevention and deadlock avoidance in flexible manufacturing systems using Petri net models , 1990, IEEE Trans. Robotics Autom..

[13]  John G. Thistle,et al.  Blocking in Fully Connected Networks of Arbitrary Size , 2012, IEEE Transactions on Automatic Control.

[14]  MengChu Zhou,et al.  Deadlock Control of Automated Manufacturing Systems Based on Petri Nets—A Literature Review , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

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

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[19]  Leslie Lamport.  The synchronization of independent processes , 2004, Acta Informatica.

[20]  MengChu Zhou,et al.  Liveness of an extended S3PR , 2010, Autom..

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

[22]  John G. Thistle,et al.  Weak invariant simulation: Properties and algorithms , 2013, 2013 American Control Conference.

[23]  Nejib Ben Hadj-Alouane,et al.  Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation , 1996, Discret. Event Dyn. Syst..

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