Throughput approximation of decision free processes using decomposition

We present an approach for the efficient approximation of the throughput of decision free processes, a class of stochastic process algebra models. Stochastic process algebras are modeling formalisms which are based on communicating sequential processes, in contrast to stochastic Petri nets which focus on causality and concurrency. The algorithm we are using is based on model decomposition at the specification level of stochastic process algebras and has been adopted from marked graphs, a well known sub-class of Petri nets. It works in a divide and conquer fashion and it is able to reduce the size of the state space by more than one order of magnitude while the deviation of the exact result is relatively low.

[1]  Marina Ribaudo.  On the Aggregation Techniques in Stochastic Petri Nets and Stochastic Process Algebras , 1995, Comput. J..

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

[3]  Susanna Donatelli,et al.  A comparison of performance evaluation process algebra and generalized stochastic Petri nets , 1995, Proceedings 6th International Workshop on Petri Nets and Performance Models.

[4]  Manuel Silva Suárez,et al.  Approximate Throughput Computation of Stochastic Marked Graphs , 1994, IEEE Trans. Software Eng..

[5]  Manuel Silva Suárez,et al.  Approximate Throughput Computation of Stohastic Marked Graphs , 1992, J. Parallel Distributed Comput..

[6]  Matteo Sereno.  Towards a Product Form Solution for Stochastic Process Algebras , 1995, Comput. J..

[7]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[8]  Jane Hillston,et al.  A Simple Time Scale Decomposition Technique for Stochastic Process Algebras , 1995, Comput. J..

[9]  Holger Hermanns,et al.  Stochastic Process Algebras , 1995 .

[10]  Giovanni Chiola,et al.  A structural colour simplification in well-formed coloured nets , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

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

[12]  Peter G. Harrison,et al.  Exploiting Quasi-reversible Structures in Markovian Process Algebra Models , 1995, Comput. J..

[13]  Holger Hermanns,et al.  Formal Characterisation of Immediate Actions in SPA with Nondeterministic Branching , 1995, Comput. J..

[14]  Tommaso Bolognesi.  A graphical composition theorem for networks of LOTOS processes , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[15]  Marina Ribaudo,et al.  Stochastic Petri net semantics for stochastic process algebras , 1995, Proceedings 6th International Workshop on Petri Nets and Performance Models.

[16]  A. Desrochers,et al.  An Approximation Method For The Performance Analysis Of Manufacturing Systems Based On GSPNs , 1992, Proceedings of the Third International Conference on Computer Integrated Manufacturing,.

[17]  Norbert Götz,et al.  Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras , 1993, Performance/SIGMETRICS Tutorials.

[18]  Manuel Silva Suárez,et al.  Improving the linearly based characterization of P/T nets , 1991, Applications and Theory of Petri Nets.

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

[20]  Holger Hermanns,et al.  Gspn and Spa Compared in Practice Modelling a Distributed Mail System , 1995 .

[21]  Roberto Gorrieri,et al.  Extended Markovian Process Algebra , 1996, CONCUR.

[22]  François Baccelli,et al.  Quantitative Methods in Parallel Systems , 1995, Esprit Basic Research Series.