Abstract
In this paper we review the Stochastic High Level Petri Nets, SHLPNs, introduced in [LiM86] and discuss the difficulties encountered in designing tools to automate the analysis of SHLPNs. Construction of net invariants and reachability trees for different classes of high level nets lead to open problems. We present High Level Petri Nets with marking variables and show that for this class of nets it is possible to construct efficiently the reachability tree. The algorithm is based upon equivalence and covering relations among marking variables. Then we discuss the compound token and token flow path concepts and present an algorithm to compute the S-invariants.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
