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

Authors:
Anne Bouillard;Stefan Haar;Sidney Rosario
Affiliations:
Irisa/ENS Cachan, Rennes, France;INRIA Saclay/ENS Cachan, Cachan, France 94235;Irisa/Inria Rennes, Rennes, France
Venue:
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Year:
2009

Citing 12
Cited 0

Branching processes of Petri nets

Acta Informatica
Metric semantics for true concurrent real time

Theoretical Computer Science
An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verification of Workflow Nets

ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
True-concurrency probabilistic models branching cells and distributed probabilities for event structures

Information and Computation
Probabilistic event structures and domains

Theoretical Computer Science - Concurrency theory (CONCUR 2004)
True-concurrency probabilistic models: Markov nets and a law of large numbers

Theoretical Computer Science
Monotonicity in Service Orchestrations

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Event structure semantics of Orc

WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Stochastic Petri Nets: Modelling, Stability, Simulation

Stochastic Petri Nets: Modelling, Stability, Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.