ON THE EFFICIENT CONSTRUCTION OF THE TANGIBLE REACHABILITY GRAPH OF GENERALIZED STOCHASTIC PETRI NETS.

G. Balbo, G. Chiola, G. Franceschinis, G. Molinar Roet

Risultato della ricerca: Capitolo in libro/report/atti di convegnoContributo a conferenzapeer review

Abstract

The explosion of the number of vanishing markings in generalized stochastic Petri net (GSPN) models with a reasonably small number of tangible states is an important practical problem that may prevent the solution of relatively simple models. A definition of GSPN in which structural properties of the underlying PN are used to guide the specification of random switches at the net level is utilized to partition the immediate transitions of a model into extended conflict sets that may be treated independently of each other. The parallelism and the independence inherent in this approach are used to devise efficient algorithms for the construction of the state space of the Markov model associated with a GSPN in which subnets of immediate transitions are identified and multiple firing of immediate transitions is performed.

Lingua originaleInglese
Titolo della pubblicazione ospiteUnknown Host Publication Title
EditoreIEEE
Pagine136-145
Numero di pagine10
ISBN (stampa)0818607963
Stato di pubblicazionePubblicato - 1987
Pubblicato esternamente

Fingerprint

Entra nei temi di ricerca di 'ON THE EFFICIENT CONSTRUCTION OF THE TANGIBLE REACHABILITY GRAPH OF GENERALIZED STOCHASTIC PETRI NETS.'. Insieme formano una fingerprint unica.

Cita questo