Recently, in the area of modelling and analysis with Stochastic Well-formed Net it has been introduced a framework that shows promising results for efficient structural analysis. This paper, exploiting such framework, considers a basic task of most SWN analysis methods: the computation of the transitions enabled in a given marking. This task does not affect the efficiency of reachability graph construction only, but also the methods based on model-checking, and especially the discrete-event simulation, which is an interesting alternative when exact stochastic Markovian solutions of SWN are hard to obtain due to the state-space explosion problem or when more general probabilistic distributions are used in the model description.
Efficient enabling test in simulation of SWN / L. Capra, M. De Pierro - In: Modelling and simulation 2006 : the European Simulation and Modelling Conference 2006, ESM 2006 : october 23-25, 2006, Toulouse, France / [a cura di] A. Nketsa, M. Paludetto, C. Bertelle. - Ghent : EUROSIS-ETI, 2006. - ISBN 9077381309. - pp. 367-374 (( Intervento presentato al 20. convegno European Simulation and Modelling Conference (ESM) tenutosi a Toulouse, France nel 2006.
Efficient enabling test in simulation of SWN
L. CapraPrimo
;
2006
Abstract
Recently, in the area of modelling and analysis with Stochastic Well-formed Net it has been introduced a framework that shows promising results for efficient structural analysis. This paper, exploiting such framework, considers a basic task of most SWN analysis methods: the computation of the transitions enabled in a given marking. This task does not affect the efficiency of reachability graph construction only, but also the methods based on model-checking, and especially the discrete-event simulation, which is an interesting alternative when exact stochastic Markovian solutions of SWN are hard to obtain due to the state-space explosion problem or when more general probabilistic distributions are used in the model description.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.