Results 211 to 220 of about 20,113 (245)
Some of the next articles are maybe not open access.
2002
Use of the standard set of SPN building blocks to model very large or complex systems can sometimes result in nets that have an enormous number of places and transitions. One popular strategy for obtaining more concise specifications in such cases is to associate “colors” with both tokens and transitions and to work with “colored stochastic Petri nets”
openaire +1 more source
Use of the standard set of SPN building blocks to model very large or complex systems can sometimes result in nets that have an enormous number of places and transitions. One popular strategy for obtaining more concise specifications in such cases is to associate “colors” with both tokens and transitions and to work with “colored stochastic Petri nets”
openaire +1 more source
Generalized Stochastic Petri Nets
1998The key factor that limits the applicability of SPN models is the complexity of their analysis. This is due to many elements. The possibly very large number of reachable markings is the most critical one. Other aspects may add to the model solution complexity.
openaire +1 more source
ACM SIGMETRICS Performance Evaluation Review, 1998
Falko Bause, Pieter S. Kritzinger
openaire +1 more source
Falko Bause, Pieter S. Kritzinger
openaire +1 more source
High-Level Stochastic Petri Nets
1998High-level Petri nets provide a more compact representation of complex DEDS’s, hence, they represent a natural choice for an alternative representation if the time concept can be embedded into them. Different types of high-level Petri nets (HLPN’s) have been proposed, for example, predicate/transition (Pr/T) nets [GL79, GL81, Gen90], colored Petri nets
openaire +1 more source
Stochastic Petri net semantics for stochastic process algebras
Proceedings 6th International Workshop on Petri Nets and Performance Models, 2002We define a stochastic Petri net (SPN) semantics for stochastic process algebras (SPAs), a recently introduced formalism that offers a novel approach for performance modeling. The proposed semantics is evaluated in terms of three criteria: concurrency and retrievability, as defined by Olderog (1987, 1991) for untimed net semantics, and Markov ...
openaire +1 more source
Modelling with Stochastic Petri Nets
2002Stochastic Petri nets (SPNs) are well suited to representing concurrency, synchronization, precedence, and priority. After presenting the basic SPN building blocks in Section 2.1, we give a series of examples in Section 2.2 that illustrates the use of SPNs for modelling discrete-event systems.
openaire +1 more source
Introduction to Stochastic Petri Nets
2001Stochastic Petri Nets are a modelling formalism that can be conveniently used for the analysis of complex models of Discrete Event Dynami Systems (DEDS) and for their performance and reliability evaluation. The automatic construction of the probabilistic models that underly the dynamic behaviours of these nets rely on a set of results that derive from ...
openaire +2 more sources