An efficient well-specified check

Daniel D. Deavours, William H. Sanders

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A long-standing problem with generalized stochastic Petri nets and extensions is that of what to do when more than one zero-timed event is scheduled to occur at the same time. If the order is left unspecified, it could lead to ambiguity that affects reward variables. Stochastic activity nets (SANs) have used the well-specified condition to avoid this problem. However, the existing algorithm to perform the well-specified check is computationally complex, proportional to the number of paths through unstable markings. We provide some theoretical results that allow us to make use of a much more efficient algorithm, with complexity proportional to the number of arcs between unstable markings.

Original languageEnglish (US)
Title of host publicationProceedings - 8th International Workshop on Petri Nets and Performance Models, PNPM 1999
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages124-133
Number of pages10
ISBN (Electronic)0769503314, 9780769503318
DOIs
StatePublished - 1999
Event8th International Workshop on Petri Nets and Performance Models, PNPM 1999 - Zaragoza, Spain
Duration: Sep 8 1999Sep 10 1999

Publication series

NameProceedings - 8th International Workshop on Petri Nets and Performance Models, PNPM 1999

Other

Other8th International Workshop on Petri Nets and Performance Models, PNPM 1999
CountrySpain
CityZaragoza
Period9/8/999/10/99

Keywords

  • Markov process
  • Stochastic Petri nets
  • Stochastic activity networks
  • Well-defined
  • Well-specified

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modeling and Simulation
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'An efficient well-specified check'. Together they form a unique fingerprint.

Cite this