Integrating TwoTowers and GreatSPN through a compact net semantics

Stochastic process algebras (SPAs) and stochastic Petri nets (SPNs) are two well known formal methods for the functional and performance modeling and analysis of computer, communication and software systems. Starting from the mappings from process algebras to Petri nets proposed in the literature to provide a truly concurrent semantic framework to concurrent programming languages, in this paper, we define a new SPN semantics for SPAs in order to facilitate the integration and the cross-fertilization between the two formalisms. We then prove that our net semantics is correct via a retrievability result. Afterwards, we demonstrate that it improves on the previously proposed net semantics with respect to the size of the resulting SPNs and on the standard interleaving semantics because of the detection of system symmetries. Furthermore, we illustrate its usefulness by showing how to reinterpret at the SPA level the results efficiently obtainable at the SPN level. Finally, we describe the implementation of our net semantics that has been realized to integrate the extended Markovian process algebra with generative-reactive synchronizations (EMPAgr) based software tool Two Towers with the generalized stochastic Petri net based software tool GreatSPN.

[1]  Marco Bernardo,et al.  Integrating Two Towers and GreatSPN , 2000, ICALP Satellite Workshops.

[2]  Giovanni Chiola,et al.  Operational analysis of timed Petri nets and application to the computation of performance bounds , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[3]  R. Gorrieri.  A Petri Net Semantics for -calculus ? , 1995 .

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

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

[6]  Giovanni Chiola,et al.  On Well-Formed Coloured Nets and Their Symbolic Reachability Graph , 1991 .

[7]  William H. Sanders,et al.  Reduced Base Model Construction Methods for Stochastic Activity Networks , 1991, IEEE J. Sel. Areas Commun..

[8]  Marco Ajmone Marsan,et al.  GSPN Models of Markovian Multiserver Multiqueue Systems , 1990, Perform. Evaluation.

[9]  Rance Cleaveland,et al.  A Front-End Generator for Verification Tools , 1995, TACAS.

[10]  Roberto Gorrieri,et al.  On the Expressiveness of Linda Coordination Primitives , 2000, Inf. Comput..

[11]  Roberto Gorrieri,et al.  A Petri Net Semantics for pi-Calculus , 1995, CONCUR.

[12]  Giovanni Chiola,et al.  GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets , 1995, Perform. Evaluation.

[13]  Holger Hermanns,et al.  Exploiting Symmetries in Stochastic Process Algebras , 1998, ESM.

[14]  Glynn Winskel,et al.  The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.

[15]  Rance Cleaveland,et al.  The NCSU Concurrency Workbench , 1996, CAV.

[16]  Ernst-Rüdiger Olderog,et al.  Nets, terms and formulas , 1991 .

[17]  Roberto Gorrieri,et al.  A Distributed Semantics for EMPA Based on Stochastic Contextual Nets , 1995, Comput. J..

[18]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

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

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

[21]  Marco Bernardo,et al.  Compact Net Semantics for Process Algebras , 2000, FORTE.

[22]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[23]  Ursula Goltz.  On Representing CCS Programs by Finite Petri Nets , 1988, MFCS.

[24]  Stephen Gilmore,et al.  Elementary structural analysis for PEPA , 1997 .

[25]  William H. Sanders,et al.  Reduced base model construction methods for stochastic activity networks , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[26]  Stephen Gilmore,et al.  An Efficient Algorithm for Aggregating PEPA Models , 2001, IEEE Trans. Software Eng..

[27]  Holger Hermanns,et al.  Interactive Markov Chains , 2002, Lecture Notes in Computer Science.

[28]  G. Winskel.  The formal semantics of programming languages , 1993 .

[29]  Mario Bravetti,et al.  Compositional Asymmetric Cooperations for Process Algebras with Probabilities, Priorities, and Time , 2000, MTCS.

[30]  Rance Cleaveland,et al.  TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems , 1998, FORTE.