Stochastic Petri nets (SPNs) is a well-known model for quantitative analysis. We consider the class called DTWSPNs that is a modification of discrete time SPNs (DTSPNs) by transition labeling and weights. Transitions of DTWSPNs are labeled by actions that represent elementary activities and can be visible or invisible for an external observer. For DTWSPNs, interleaving and step probabilistic τ ...

Shortest path problem in stochastic graphs has been recently studied in the literature and a number of algorithms has been provided to find it using varieties of learning automata models. However, all these algorithms suffer from two common drawbacks: low speed and lack of a clear termination condition. In this paper, we propose a novel learning automata-based algorithm for this problem which c...

Many modern computer and communication systems result in large, complex performance models. The compositional approach ooered by stochastic process algebra constructs a model from submodels which are smaller and more easily understood. This gives the model a clear component-based structure. In this paper we present cases when this structure may be used to inform the solution of the model, leadi...

In many research projects on modeling and analyzing biological pathways, the Petri net has been recognized as a promising method for representing biological pathways. From the pioneering works by Reddy et al., 1993, and Hofestädt, 1994, that model metabolic pathways by traditional Petri net, several enhanced Petri nets such as colored Petri net, stochastic Petri net, and hybrid Petri net have b...

The growing complexity of modern systems has escalated the need for performance metrics. Stochastic models such as queuing networks and stochastic Petri nets have been used to model these systems so that their performance measures can be evaluated analytically. Product-form solutions are equilibrium state probabilities in networks of stochastic nodes (e.g. queues) in the form of a product of te...

Over the last two decades many techniques have been developed to specify and evaluate Markovian dependability models. Most often, these Markovian models are automatically derived from stochastic Petri nets, stochastic process algebras, or stochastic activity networks. However, whereas the model specification has become very comfortable, the specification of the dependability measures of interes...

In this paper, we propose astochastic Petri net model P-timed Workflow (WPTSPN) to specify, verify, and analyze a business process (BP) of Flexible Manufacturing System (FMS). After formalizing the semantics our model, illustrate how verifysome its properties (reachability, safety, boundedness, liveness, correctness, alive tokens, security) in P-Timed context. Next, validate relevance proposed ...

30 the CTMCs may have more than 10 30 states. A prototype version of the program used to compute the results we presented is available and can be obtained by contacting the second author. The input to the program has a SPNP-style syntax 9]. The eeect of execution policies on the semantics and analyis of Stochastic Petri Nets. IEEE Trans. 29 immediate synchronizing transitions. Preservation of a...

Biological systems are often very complex so that an appropriate formalism is needed for modeling their behavior. Hybrid Petri Nets, consisting of time-discrete Petri Net elements as well as continuous ones, have proven to be ideal for this task. Therefore, a new Petri Net library was implemented based on the object-oriented modeling language Modelica which allows the modeling of discrete, stoc...