Colored Petri nets are a formalism widely used to specify and analyze workflow models. Finding the set of transition color instances enabled in a given marking is a basic task affecting reachability graph construction, model-checking, and especially discrete-event simulation, which is an interesting alternative when analytical solutions are unfeasible due to state-space explosion. An introduced symbolic approach to colored transition enabling test is the kernel for the efficient implementation of several algorithms for the analysis of SWN (a stochastic CPN flavor retaining power that exploits behavioral symmetries) based on state-space exploration. An application example of the symbolic enabling test for efficient simulation of SWN workflow models is presented. The example shows that the technique can be easily integrated to the SWN symbolic firing rule

Applying a symbolic approach for SWN enabling test to workflow models / L. Capra - In: Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2006 : 26-29 september, 2006, Timisoara, Romania : proceedings / [a cura di] V. Negru, D. Pectu, D. Zaharie, A. Abraham, B. Buchberger. - Los Alamitos : IEEE Computer Society, 2007. - ISBN 076952740X. - pp. 437-444 (( Intervento presentato al 8. convegno International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) tenutosi a Timisoara, Romania nel 2006.

Applying a symbolic approach for SWN enabling test to workflow models

L. Capra
Primo
2007

Abstract

Colored Petri nets are a formalism widely used to specify and analyze workflow models. Finding the set of transition color instances enabled in a given marking is a basic task affecting reachability graph construction, model-checking, and especially discrete-event simulation, which is an interesting alternative when analytical solutions are unfeasible due to state-space explosion. An introduced symbolic approach to colored transition enabling test is the kernel for the efficient implementation of several algorithms for the analysis of SWN (a stochastic CPN flavor retaining power that exploits behavioral symmetries) based on state-space exploration. An application example of the symbolic enabling test for efficient simulation of SWN workflow models is presented. The example shows that the technique can be easily integrated to the SWN symbolic firing rule
Settore INF/01 - Informatica
2007
Research Institute for Symbolic Computation Johannes Kepler University, Research Institute e-Austria Timisoara
Book Part (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/31206
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact