Proceedings of the Fourth International Workshop on Petri Nets and Performance Models (1991)

Melbourne, Victoria, Australia

Dec. 2, 1991 to Dec. 5, 1991

ISBN: 0-8186-2285-7

pp: 204-209

G. Florin , CEDRIC, Paris, France

C. Fraize , CEDRIC, Paris, France

S. Natkin , CEDRIC, Paris, France

ABSTRACT

Probabilistic validation is a new approach to deal with large state transitions systems. The user's need is to prove that, for a given period of operations, that a given assertion on the reached states is true with a sufficient level of probability. The system to be validated is modeled by a stochastic Petri net. The analysis relies on a partial exploration of the reachability set and tries to reach as quickly as possible critical states (states in which the assertion is not verified). An exact linear program solution allows to 'travel' through the graph. The main goal of the paper is to present the principles of this searching algorithm.<>

INDEX TERMS

Petri nets, search problems

CITATION

G. Florin, C. Fraize and S. Natkin, "Searching best paths to worst states,"

*Proceedings of the Fourth International Workshop on Petri Nets and Performance Models(PNPM)*, Melbourne, Victoria, Australia, , pp. 204-209.

doi:10.1109/PNPM.1991.238800

CITATIONS