An efficient well-specified check
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 124-133
- https://doi.org/10.1109/pnpm.1999.796559
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
This publication has 5 references indexed in Scilit:
- Well-defined stochastic Petri netsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithms for the generation of state-level representations of stochastic activity networks with general reward structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithms for the generation of state-level representations of stochastic activity networks with general reward structuresIEEE Transactions on Software Engineering, 1996
- Generalized stochastic Petri nets: a definition at the net level and its implicationsIEEE Transactions on Software Engineering, 1993
- A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systemsACM Transactions on Computer Systems, 1984