Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net

In concurrent real-time processes, the speed of individual components has a double impact: on the one hand, the overall latency of a compound process is affected by the latency of its components. But, if the composition has race conditions, the very outcome of the process will also depend on the latency of component processes. Using stochastic Petri nets, we investigate the probability of a transition occurrence being critical for the entire process, i.e. such that a small increase or decrease of the duration of the occurrence entails an increase or decrease of the total duration of the process. The first stage of the analysis focuses on occurrence nets, as obtained by partial order unfoldings, to determine criticality of events; we then lift to workflow nets to investigate criticality of transitions inside a workflow.

[1]  Andrew D. Gordon,et al.  Verified Reference Implementations of WS-Security Protocols , 2006, WS-FM.

[2]  Albert Benveniste,et al.  Monotonicity in Service Orchestrations , 2009, Petri Nets.

[3]  Albert Benveniste,et al.  Markov nets: probabilistic models for distributed and concurrent systems , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[4]  Jean Mairesse,et al.  Modeling and analysis of timed Petri nets using heaps of pieces , 1997, 1997 European Control Conference (ECC).

[5]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[6]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[7]  J. Hannan,et al.  Introduction to probability and mathematical statistics , 1986 .

[8]  Albert Benveniste,et al.  True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures , 2006, Inf. Comput..

[9]  Glynn Winskel,et al.  Probabilistic event structures and domains , 2004, Theor. Comput. Sci..

[10]  Christel Baier,et al.  Metric semantics for true concurrent real time , 2001, Theor. Comput. Sci..

[11]  Wil M. P. van der Aalst,et al.  Verification of Workflow Nets , 1997, ICATPN.

[12]  Albert Benveniste,et al.  Probabilistic models for true-concurrency: branching cells and distributed probabilities for event structures , 2006 .

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

[14]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..

[15]  Diego Latella,et al.  First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders , 2001, TACAS.

[16]  Joost Engelfriet,et al.  Branching processes of Petri nets , 1991, Acta Informatica.

[17]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[18]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[19]  Albert Benveniste,et al.  Event Structure Semantics of Orc , 2007, WS-FM.

[20]  Albert Benveniste,et al.  True-concurrency probabilistic models: Markov nets and a law of large numbers , 2008, Theor. Comput. Sci..

[21]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[22]  Peter J. Haas,et al.  Stochastic Petri Nets: Modelling, Stability, Simulation , 2002 .

[23]  Peter J. Haas,et al.  Stochastic Petri Nets , 2002 .

[24]  Z. W. Birnbaum,et al.  An Introduction to Probability and Mathematical Statistics , 1963 .

[25]  Albert Benveniste,et al.  Probabilistic QoS and Soft Contracts for Transaction-Based Web Services Orchestrations , 2008, IEEE Transactions on Services Computing.

[26]  Gianfranco Balbo,et al.  Application and Theory of Petri Nets 1997 , 1997 .