Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling an...

Based on the Extended Colored Stochastic Petri Nets (ECSPN), the workflow system was modeled and simulated. To improve described capacity of the traditional Petri nets, a model of the extended colored stochastic Petri nets is proposed, and then an instance is given to explain how to model workflow system with priority queuing and multi-instances. Through analysis of the simulation data of the m...

Stochastic simulations are able to capture the fine grain behaviour and randomness of outcome of biological networks not captured by deterministic techniques. As such they are becoming an increasingly important tool in the biological community. However, current efforts in the stochastic simulation of biological networks are hampered by two main problems: firstly the lack of complete knowledge o...

Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present Version 2.0 of our tool QPME (Queueing Petri net Modeling Environment) ...

Transient analysis of Markov Regenerative Processes (MRPs) can be performed through the solution of Markov renewal equations defined by global and local kernels, which respectively characterize the occurrence of regenerations and transient probabilities between them. To derive kernels from stochastic models (e.g., stochastic Petri nets), existing methods exclusively address the case where at mo...

Local area networks are representative of a growing class of distributed systems which demand more sophisticated methods and tools to evaluate system behavior in the presence of faults. In particular, since they are likely to exhibit degradable performance, the concept of performability can provide more re ned assessments of their ability to perform under fault and error conditions. This paper ...

There is a need for modeling and performance evaluation techniques and tools for a fast and reliable design of workkow systems. This paper introduces a modeling methodology based on colored stochastic Petri nets. It allows the integration of functional, organizational, and timing aspects in one modeling framework. The processing delays include stochastic distributions in addition to determinist...

This paper presents an efficient method to derive the first passage time of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine which is a semi-Markov process. The mean and the variance of the first passage time are derived by algebraic manipulations with ...

In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but without any additional constraint. Rather than computing an approximate distribution of the model (as done in previous methods), we develop an exact analysis of an approximate model. The design of this method leads to a uniform...

This paper describes a symbolic model checking approach for the Continuous Stochastic Reward Logic (CSRL) and stochastic reward nets, stochastic Petri nets augmented with rate rewards. CSRL model checking requires the computation of the joint distribution of time and accumulated reward, which is done by Markovian approximation. An implementation is available in the model checker MARCIE. It appl...