The design of evolving discrete-event systems needs for adequate modeling techniques. A Petri net-based reflective layout has been recently proposed to support dynamic discreteevent system's design. Keeping functional aspects separated from evolutionary ones, deploying changes to the (current) system configuration when necessary, results in a clean formal model preserving the ability of verifying properties typical of Petri nets. Reflective Petri nets are provided with a pseudo-symbolic statetransition graph, and an associated lumped Markov process.
A symbolic reachability graph and associated Markov process for a class of dynamic Petri nets / L. Capra - In: 18th Annual IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2010 : 17-19 august 2010, Miami Beach, USA : proceedingsLos Alamitos : IEEE Computer Society, 2010. - ISBN 9780769541976. - pp. 458-461 (( Intervento presentato al 18. convegno Annual IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) tenutosi a Miami Beach, USA nel 2010 [10.1109/MASCOTS.2010.65].
A symbolic reachability graph and associated Markov process for a class of dynamic Petri nets
L. CapraPrimo
2010
Abstract
The design of evolving discrete-event systems needs for adequate modeling techniques. A Petri net-based reflective layout has been recently proposed to support dynamic discreteevent system's design. Keeping functional aspects separated from evolutionary ones, deploying changes to the (current) system configuration when necessary, results in a clean formal model preserving the ability of verifying properties typical of Petri nets. Reflective Petri nets are provided with a pseudo-symbolic statetransition graph, and an associated lumped Markov process.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.