An Efficient Well-Specified Check

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Daniel D. Deavours Articles by William H. Sanders

Eighth International Workshop on Petri Nets and Performance Models (PNPM '99)

Zaragoza, Spain

September 08-September 10

ISBN: 0-7695-0331-4

	ASCII Text	x
	Daniel D. Deavours, William H. Sanders, "An Efficient Well-Specified Check," Petri Nets and Performance Models, IEEE International Workshop on, pp. 124, Eighth International Workshop on Petri Nets and Performance Models (PNPM '99), 1999.

	BibTex	x
	@article{ 10.1109/PNPM.1999.796559, author = {Daniel D. Deavours and William H. Sanders}, title = {An Efficient Well-Specified Check}, journal ={Petri Nets and Performance Models, IEEE International Workshop on}, volume = {0}, year = {1999}, issn = {1063-6714}, pages = {124}, doi = {http://doi.ieeecomputersociety.org/10.1109/PNPM.1999.796559}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Petri Nets and Performance Models, IEEE International Workshop on TI - An Efficient Well-Specified Check SN - 1063-6714 SP EP A1 - Daniel D. Deavours, A1 - William H. Sanders, PY - 1999 KW - Stochastic Petri nets KW - stochastic activity networks KW - Markov process KW - well-specified KW - well-defined VL - 0 JA - Petri Nets and Performance Models, IEEE International Workshop on ER -

Daniel D. Deavours, University of Illinois at Urbana-Champaign

William H. Sanders, University of Illinois at Urbana-Champaign

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PNPM.1999.796559

A longstanding 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) [6,7] 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.

Index Terms:

Stochastic Petri nets, stochastic activity networks, Markov process, well-specified, well-defined

Citation:

Daniel D. Deavours, William H. Sanders, "An Efficient Well-Specified Check," pnpm, pp.124, Eighth International Workshop on Petri Nets and Performance Models (PNPM '99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.