Reachability Graphs and Invariants for Stochastic High Level Petri Nets

The paper investigates the properties of Stochastic High Level Petri nets. The research is motivated by the idea of using Slll..PNs as high level descriptions of stochastic models. An algorithm for constructing the reachabiliry graph is presented and the invariants of a Stochastic High Level Petri net are discussed.

[1]  Michael K. Molloy.  Performance Analysis Using Stochastic Petri Nets , 1982, IEEE Transactions on Computers.

[2]  Dan C. Marinescu,et al.  Domain oriented analysis of PDE splitting algorithms , 1987, Inf. Sci..

[3]  Gérard Roucairol,et al.  Linear Algebra in Net Theory , 1979, Advanced Course: Net Theory and Applications.

[4]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[5]  Kurt Jensen.  High-Level Petri Nets , 1982, European Workshop on Applications and Theory of Petri Nets.

[6]  Kurt Jensen,et al.  Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[7]  Dan C. Marinescu,et al.  On Stochastic High-Level Petri Nets , 1987, PNPM.

[8]  Peter Radford,et al.  Petri Net Theory and the Modeling of Systems , 1982 .

[9]  Dan C. Marinescu,et al.  Stochastic High-Level Petri Nets and Applications , 1988, IEEE Trans. Computers.

[10]  Peter Huber,et al.  Towards reachability trees for high-level Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.