@inproceedings{ce4d713df33d4da08b6064330fe728ed,
title = "An efficient well-specified check",
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.",
keywords = "Markov process, Stochastic Petri nets, Stochastic activity networks, Well-defined, Well-specified",
author = "Deavours, \{Daniel D.\} and Sanders, \{William H.\}",
note = "This work was supported, in part, by DARPA/ITO under Contract No. DABT63-96-C-0069. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA/ITO.; 8th International Workshop on Petri Nets and Performance Models, PNPM 1999 ; Conference date: 08-09-1999 Through 10-09-1999",
year = "1999",
doi = "10.1109/PNPM.1999.796559",
language = "English (US)",
series = "Proceedings - 8th International Workshop on Petri Nets and Performance Models, PNPM 1999",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "124--133",
booktitle = "Proceedings - 8th International Workshop on Petri Nets and Performance Models, PNPM 1999",
address = "United States",
}