What a Structural World

Abstract: Petri nets and stochastic Petri nets have been widely adopted as one of the best tools to model the logical and timing behavior of discrete-state systems. However, their practical applicability is limited by the state-space explosion problem. We survey some of the techniques that have been used to cope with large state spaces, starting from early explicit methods, which require data structures of size proportional to the number of states or state-to-state transitions, then moving to implicit methods, which borrow ideas from symbolic model checking (binary decision diagrams) and numerical linear algebra (Kronecker operators) to drastically reduce the computational requirements. Next, we describe the structural decomposition approach which has been the topic of our research in the last few years. This method only requires to specify a partition of the places in the net and, combining decision diagrams and Kronecker operators with the new concepts of event locality and node saturation, achieves fundamental gains in both memory and time efficiency. At the same, the approach is applicable to a wide range of models. We conclude by considering several research directions that could further push the range of solvable models, eventually leading to an even greater industrial acceptance of this simple yet powerful modeling formalism.

[1]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

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

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

[4]  Gianfranco Ciardo,et al.  Using the exact state space of a Markov model to compute approximate stationary measures , 2000, SIGMETRICS '00.

[5]  William H. Sanders,et al.  Stochastic Activity Networks: Structure, Behavior, and Application , 1985, PNPM.

[6]  Paulo Fernandes,et al.  Efficient descriptor-vector multiplications in stochastic automata networks , 1998, JACM.

[7]  Oded Maler,et al.  On the Representation of Probabilities over Structured Domains , 1999, CAV.

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

[9]  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).

[10]  Kishor S. Trivedi,et al.  Automated Generation and Analysis of Markov Reward Models Using Stochastic Reward Nets , 1993 .

[11]  Gianfranco Ciardo,et al.  Data structures for the analysis of large structured markov models , 2000 .

[12]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

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

[14]  C. Petri.  Kommunikation mit Automaten , 1962 .

[15]  Brigitte Plateau.  On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS 1985.

[16]  Edmund M. Clarke,et al.  Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.

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

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

[19]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[20]  Gianfranco Ciardo,et al.  Efficient Symbolic State-Space Construction for Asynchronous Systems , 2000, ICATPN.

[21]  Rüdiger Valk.  On the Computational Power of Extended Petri Nets , 1978, MFCS.

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

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

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

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

[26]  Aldo Cumani,et al.  ESP - A Package for the Evaluation of Stochastic Petri Nets with Phase-Type Distributed Transition Times , 1985, PNPM.

[27]  Michael K. Molloy,et al.  On the integration of delay and throughput measures in distributed processing models , 1981 .

[28]  Susanna Donatelli,et al.  Superposed Stochastic Automata: A Class of Stochastic Petri Nets with Parallel Solution and Distributed State Space , 1993, Perform. Evaluation.

[29]  Rüdiger Valk,et al.  Generalizations of Petri Nets , 1981, MFCS.

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