A lumped Markov process for a class of dynamic Petri nets

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.