A symbolic simulation mechanism for well-formed coloured Petri nets
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Coloured Petri nets are well suited to the modelling of realistic distributed systems. Such models are however usually too large and complex to analyze and simulate using standard techniques. Originally the model symmetries inherent to the colour definitions of stochastic well-formed nets were exploited for Markovian analysis. The authors propose a similar technique to substantially reduce the average length of the event list in case of large and symmetric models. Examples of real simulation models of multiprocessor system architectures show that, after a given threshold, the symbolic simulation time may be virtually independent of the actual size of the system to be modelled, thus making the simulation of systems with thousand processors as inexpensive as the simulation of systems with only few processors.Keywords
This publication has 5 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
- Coloured Petri Nets: A High Level Language for System Design and AnalysisPublished by Springer Nature ,1991
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- Stochastic petri net simulationPublished by Association for Computing Machinery (ACM) ,1989
- Coloured petri nets and the invariant-methodTheoretical Computer Science, 1981