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

M. A. Qureshi, William H Sanders, A. P.A. van Moorsel, R. German

Research output: Contribution to conferencePaper

Abstract

Stochastic Petri nets (SPNs) 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. In this paper, discussed are issues regarding the generation of state-level reward models for systems specified as stochastic activity networks (SANs) with 'step-based reward structures.' While discussing issues related to the generation of the underlying state-level reward model, an algorithm to determine whether a given SAN is 'well-specified' is provided.

Original languageEnglish (US)
Pages180-190
Number of pages11
StatePublished - Dec 1 1995
EventProceedings of the 6th International Workshop on Petri Nets and Performance Models - Durham, NC, USA
Duration: Oct 3 1995Oct 6 1995

Other

OtherProceedings of the 6th International Workshop on Petri Nets and Performance Models
CityDurham, NC, USA
Period10/3/9510/6/95

Fingerprint

Petri nets
Reward
Stochastic Petri Nets
Random processes
Performance Measures
Stochastic Processes
Numerical Solution
Model

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation

Cite this

Qureshi, M. A., Sanders, W. H., van Moorsel, A. P. A., & German, R. (1995). Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures. 180-190. Paper presented at Proceedings of the 6th International Workshop on Petri Nets and Performance Models, Durham, NC, USA, .

Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures. / Qureshi, M. A.; Sanders, William H; van Moorsel, A. P.A.; German, R.

1995. 180-190 Paper presented at Proceedings of the 6th International Workshop on Petri Nets and Performance Models, Durham, NC, USA, .

Research output: Contribution to conferencePaper

Qureshi, MA, Sanders, WH, van Moorsel, APA & German, R 1995, 'Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures' Paper presented at Proceedings of the 6th International Workshop on Petri Nets and Performance Models, Durham, NC, USA, 10/3/95 - 10/6/95, pp. 180-190.
Qureshi MA, Sanders WH, van Moorsel APA, German R. Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures. 1995. Paper presented at Proceedings of the 6th International Workshop on Petri Nets and Performance Models, Durham, NC, USA, .
Qureshi, M. A. ; Sanders, William H ; van Moorsel, A. P.A. ; German, R. / Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures. Paper presented at Proceedings of the 6th International Workshop on Petri Nets and Performance Models, Durham, NC, USA, .11 p.
@conference{b7bd1d87c409422f8b790a9f45d53bc7,
title = "Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures",
abstract = "Stochastic Petri nets (SPNs) 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. In this paper, discussed are issues regarding the generation of state-level reward models for systems specified as stochastic activity networks (SANs) with 'step-based reward structures.' While discussing issues related to the generation of the underlying state-level reward model, an algorithm to determine whether a given SAN is 'well-specified' is provided.",
author = "Qureshi, {M. A.} and Sanders, {William H} and {van Moorsel}, {A. P.A.} and R. German",
year = "1995",
month = "12",
day = "1",
language = "English (US)",
pages = "180--190",
note = "Proceedings of the 6th International Workshop on Petri Nets and Performance Models ; Conference date: 03-10-1995 Through 06-10-1995",

}

TY - CONF

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

AU - Qureshi, M. A.

AU - Sanders, William H

AU - van Moorsel, A. P.A.

AU - German, R.

PY - 1995/12/1

Y1 - 1995/12/1

N2 - Stochastic Petri nets (SPNs) 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. In this paper, discussed are issues regarding the generation of state-level reward models for systems specified as stochastic activity networks (SANs) with 'step-based reward structures.' While discussing issues related to the generation of the underlying state-level reward model, an algorithm to determine whether a given SAN is 'well-specified' is provided.

AB - Stochastic Petri nets (SPNs) 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. In this paper, discussed are issues regarding the generation of state-level reward models for systems specified as stochastic activity networks (SANs) with 'step-based reward structures.' While discussing issues related to the generation of the underlying state-level reward model, an algorithm to determine whether a given SAN is 'well-specified' is provided.

UR - http://www.scopus.com/inward/record.url?scp=0029501127&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029501127&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0029501127

SP - 180

EP - 190

ER -