Equivalence and aggregation of GSPNs with labeled transitions

Equivalence is a basic concept in many modeling formalisms to compare different realizations of a system or to compute for a given system a minimal equivalent representation. We present two different equivalence relations for a class of generalized stochastic Petri nets (GSPNs) with labeled transitions (LGSPNs), namely trace equivalence and bisimulation equivalence. In contrast to most other approaches we allow labeling of timed and immediate transitions and thus have to define equivalence for a stochastic process with exponentially timed and immediate transitions. For this class of GSPNs it is possible to compose nets via timed and immediate transitions which has also been introduced for superposed generalized stochastic Petri nets (SGSPNs). We describe under which conditions the proposed equivalences are congruences according to the composition of nets. The congruence condition is easily to achieve for timed transitions but it is shown that some additional restrictions are necessary to obtain a congruence relation which is preserved under composition via immediate transitions. However, if such a congruence is defined, then component state spaces can be reduced by aggregation before composition. This aggregation includes an elimination of some immediate transitions in LGSPNs composed via immediate transitions which has not been considered yet.

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

[2]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[3]  Peter Buchholz.  Markovian process algebra: Composition and equiva-lence , 1994 .

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

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

[6]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

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

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

[9]  Peter Buchholz,et al.  A Toolbox for Functional and Quantitative Analysis of DEDS , 1998, Computer Performance Evaluation.

[10]  Holger Hermanns,et al.  Compositional performance modelling with the TIPPtool , 2000, Perform. Evaluation.

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

[12]  Carla Simone,et al.  A survey of equivalence notions for net based systems , 1992, Advances in Petri Nets: The DEMON Project.

[13]  P. Buchholz,et al.  Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models , 1997 .

[14]  Joost-Pieter Katoen,et al.  Automated compositional Markov chain generation for a plain-old telephone system , 2000, Sci. Comput. Program..

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

[16]  Peter Buchholz.  Iterative Decomposition and Aggregation of Labeled GSPNs , 1998, ICATPN.

[17]  Peter Buchholz.  A Notion of Equivalence for Stochastic Petri Nets , 1995, Application and Theory of Petri Nets.

[18]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

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