Implicit GSPN reachability set generation using decision diagrams

Implicit techniques for representing and generating the reachability set of a high-level model have become quite efficient. However, such techniques are usually restricted to models whose events have equal priority. Models containing events with differing classes of priority or complex priority structure, in particular models with immediate events, have thus been required to use less-efficient explicit reachability set generation techniques. In this paper, we present an efficient implicit technique, based on multi-valued decision diagram (MDD) representations for sets of states and matrix diagram representations for next-state functions, that can handle models with complex priority structure. We adapt an efficient Kronecker-based reachability set generation algorithm to work with matrix diagrams. If the model contains immediate events, the vanishing states can be eliminated either during generation, by manipulating the matrix diagram, or after generation, by manipulating the MDD. We apply both techniques to several models and give detailed experimental results.

[1]  Giovanni Chiola,et al.  On the Efficient Construction of the Tangible Reachability Graph of Generalized Stochastic Petri Nets , 1987, PNPM.

[2]  Peter Kemper.  Numerical Analysis of Superposed GSPNs , 1996, IEEE Trans. Software Eng..

[3]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[4]  Andrew S. Miner.  Efficient solution of GSPNs using canonical matrix diagrams , 2001, Proceedings 9th International Workshop on Petri Nets and Performance Models.

[5]  R. BurchJ.,et al.  Symbolic model checking , 1992 .

[6]  Gianfranco Ciardo,et al.  Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation , 2001, TACAS.

[7]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[8]  Tiziano Villa,et al.  Multi-valued decision diagrams: theory and applications , 1998 .

[9]  Gianfranco Ciardo,et al.  Efficient Reachability Set Generation and Storage Using Decision Diagrams , 1999, ICATPN.

[10]  G. Ciardo,et al.  ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS , 1996 .

[11]  Giovanni Chiola.  Compiling Techniques for the Analysis of Stochastic Petri Nets , 1989 .

[12]  Kishor S. Trivedi,et al.  A Decomposition Approach for Stochastic Reward Net Models , 1993, Perform. Evaluation.

[13]  Marco Ajmone Marsan,et al.  A class of generalised stochastic petri nets for the performance evaluation of multiprocessor systems , 1983, SIGMETRICS '83.

[14]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[15]  Susanna Donatelli,et al.  Integrating Synchronization with Priority into a Kronecker Representation , 2000, Computer Performance Evaluation / TOOLS.

[16]  Gianfranco Ciardo,et al.  Storage Alternatives for Large Structured State Spaces , 1997, Computer Performance Evaluation.

[17]  G. Ciardo,et al.  DISCRETE-TIME MARKOVIAN STOCHASTIC PETRI NETS , 1995 .

[18]  Holger Hermanns,et al.  On the use of MTBDDs for performability analysis and verification of stochastic systems , 2003, J. Log. Algebraic Methods Program..

[19]  Jordi Cortadella,et al.  Petri Net Analysis Using Boolean Manipulation , 1994, Application and Theory of Petri Nets.

[20]  Marco Ajmone Marsan,et al.  Approximate GSPN analysis of multiserver polling systems , 1996 .

[21]  Boudewijn R. Haverkort,et al.  On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

[22]  Gianfranco Ciardo,et al.  A data structure for the efficient Kronecker solution of GSPNs , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

[23]  Alex Blakemore,et al.  The cost of eliminating vanishing markings from generalized stochastic Petri nets , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[24]  Marco Ajmone Marsan,et al.  Generalized Stochastic Petri Nets: A Definition at the Net Level and Its Implications , 1993, IEEE Trans. Software Eng..

[25]  Peter Buchholz,et al.  Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models , 2000, INFORMS J. Comput..

[26]  Robert K. Brayton,et al.  On Computing the Transitive Closure of a State Transition Relation , 1993, 30th ACM/IEEE Design Automation Conference.

[27]  Gianfranco Ciardo,et al.  SMART: simulation and Markovian analyzer for reliability and timing , 1996, Proceedings of IEEE International Computer Performance and Dependability Symposium.

[28]  Gianfranco Ciardo,et al.  Saturation Unbound , 2003, TACAS.