Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures

Authors:
M. A. Qureshi;W. H. Sanders;A. P. A. van Moorsel;R. German
Affiliations:
-;-;-;-
Venue:
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Year:
1995

Citing 7
Cited 2

A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

ACM Transactions on Computer Systems (TOCS)
The UltraSAN modeling environment

Performance Evaluation - Special issue: performance modeling tools
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications

IEEE Transactions on Software Engineering
A Characterization of the Stochastic Process Underlying a Stochastic Petri Net

IEEE Transactions on Software Engineering
On the Efficient Construction of the Tangible Reachability Graph of Generalized Stochastic Petri Nets

PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
Stochastic Activity Networks: Structure, Behavior, and Application

International Workshop on Timed Petri Nets
Performance Analysis Using Stochastic Petri Nets

IEEE Transactions on Computers

Well-defined stochastic Petri nets

MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
"On-the-fly" Soltuion Techniques for Stochastic Petri Nets and Extensions

PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stochastic Petri nets and extensions are a popular method for evaluating a wide variety of systems. In most cases, their numerical solution requires generating a state-level stochastic process, which captures the behavior of the SPN with respect to a set of specified performance measures. These measures are commonly defined at the net level by means of a reward variable. We discuss issues regarding the generation of state-level reward models for systems specified as stochastic activity networks with "step-based reward structures." Step-based reward structures are a generalization of previously proposed reward structures for SPNs, and can represent all reward variables that can be defined on the marking behavior of a net. While discussing issues related to the generation of the underlying state-level reward model, we provide an algorithm to determine whether a given SAN is "well specified." A SAN is well specified if choices about which instantaneous activity completes among multiple simultaneously enabled instantaneous activities do not matter, with respect to the probability of reaching next possible stable markings, and distribution of reward obtained upon completion of a timed activity. The fact that a SAN is well specified is both a necessary and sufficient condition for its behavior to be completely probabilistically specified, and hence an important property to determine.