A lumped Markov process for a class of dynamic Petri nets

Authors:
Lorenzo Capra
Affiliations:
Università degli Studi Milano, Italy
Venue:
Proceedings of the 44th Annual Simulation Symposium
Year:
2011

Citing 7
Cited 0

A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

ACM Transactions on Computer Systems (TOCS)
Petri nets: an introduction

Petri nets: an introduction
High-level Petri nets: theory and application

High-level Petri nets: theory and application
The hurried philosophers

Concurrent object-oriented programming and petri nets
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications

IEEE Transactions on Computers
A Symbolic Reachability Graph and Associated Markov Process for a Class of Dynamic Petri Nets

MASCOTS '10 Proceedings of the 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Modeling dynamic architectures using nets-within-nets

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Petri net-based reflective layout (called Reflective Petri nets) based on classical (high-level) Petri nets and consolidated reflection concepts has been recently proposed as a formal model for evolving discrete-event systems. The basic idea behind that approach is keeping functional aspects separated from evolutionary ones. This way the ability of verifying properties typical of classical Petri nets is retained. As a first step toward discrete-event simulation, Reflective Petri nets have been recently provided with a with a statetransition semantics. In this paper a (lumped) Markov process is formally defined for Reflective Petri nets, having as support structure a symbolic state-transition graph.