New Solvers for Asymmetric Systems in GreatSPN

Author

Baarir, S. ; Beccuti, M. ; Franceschinis, G.

Author_Institution

Univ. del Piemonte Orientale, Alessandria

fYear

2008

fDate

14-17 Sept. 2008

Firstpage

235

Lastpage

236

Abstract

In this paper we present the extended symbolic reachability graph/dynamic symbolic reachability graph (ESRG/DSRG) framework to model and solve (asymmetric) SWN models. This framework combines several tools: GreatSPN for the model design, WNESRG to build the ESRG of the designed model, ESRG2MC to refine the ESRG and generate the corresponding MC, WNDSRG to build the DSRG and the corresponding MC. MCSolver is used to solve the MC and compute the steady state marking probability. The following section is dedicated to the detailed presentation of this new framework.

Keywords

network theory (graphs); reachability analysis; stochastic processes; ESRG2MC; GreatSPN; WNESRG; asymmetric systems; dynamic symbolic reachability graph framework; extended symbolic reachability graph framework; model design; steady state marking probability; stochastic well-formed net model; Automata; Automatic control; Computer architecture; Explosions; Partitioning algorithms; Roentgenium; Samarium; State-space methods; Stochastic systems; Telecommunication control; Aggregation; High level Petri Nets; Markov chains; Partial symmetries;

fLanguage

English

Publisher

ieee

Conference_Titel

Quantitative Evaluation of Systems, 2008. QEST '08. Fifth International Conference on

Conference_Location

St. Malo

Print_ISBN

978-0-7695-3360-5

Type

conf

DOI

10.1109/QEST.2008.38

Filename

4634976