An algebraic calculus recently introduced is the kernel for the implementation of several algorithms for the analysis of (Stochastic) Colored Petri Nets (CPN) taking advantage of structural considerations. In this paper a recurring task in several CPN analysis techniques is considered, that consists in finding the set of transition color instances enabled in a given marking. This operation affects not only reachability graph construction, but also model-checking, and especially discrete-event simulation, which is an interesting alternative when analytical solutions are unfeasible due to state-space explosion. Using an extension of the calculus it is possible to formally express the set of transition instances enabled in a given marking as a function of the marking itself.
Algebraic framework for efficient simulation of SWN / L. Capra, M. De Pierro - In: International conference on modeling and simulation : methodology, tools, software applications 2006 : Calgary, Canada, 31 july-2 august, 2006 / [a cura di] R. Huntsinger, H. Vakilzadian , T. Ören. - Vista, CA : The Society for Modeling and Simulation International, 2006. - ISBN 9781622763542. - pp. 67-74 (( convegno International Conference on Modeling and Simulation – Methodology, Tools, Software Applications tenutosi a Calgary, Canada nel 2006.
|Titolo:||Algebraic framework for efficient simulation of SWN|
CAPRA, LORENZO (Primo)
|Parole Chiave:||Colored Petri Nets; Symbolic enabling test|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||2006|
|Enti collegati al convegno:||The Society for Modeling and Simulation International|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|