A symbolic reachability graph for coloured petri nets
- 20 April 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 176 (1-2) , 39-65
- https://doi.org/10.1016/s0304-3975(96)00010-2
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- An example of modeling and evaluation of a concurrent program using colored stochastic Petri nets: Lamport's fast mutual exclusion algorithmIEEE Transactions on Parallel and Distributed Systems, 1992
- Reachability trees for high-level petri netsTheoretical Computer Science, 1986
- Performance Analysis Using Stochastic Petri NetsIEEE Transactions on Computers, 1982