Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-25T12:44:06.107Z Has data issue: false hasContentIssue false

Les Symétries dans les Réseaux de Petri Stochastiques (RdPS) Construction du Graphe Symbolique

Published online by Cambridge University Press:  15 August 2002

M. Ioualalen
Affiliation:
Institut d'Informatique, USTHB, BP. 32, EL-Alia, Algerie.
A. Aissani
Affiliation:
Universite de Blida, Algerie.
Get access

Abstract

The main purpose of this paper is to give a method for construction of the reduced reachability graph for Stochastic Petri Nets (SPN), the symbolic graph. This construction is achieved by exploiting the structural symetries in the net using the theory of bisimulation of places for detecting isomorphic parts in the net. The symbolic graph, being isomorphic to an agregated Markov chain, may be used to prove qualitative properties as liveness, boundness, ... Moreover, this reduced graph make more easy the computation of the performance measures of interest as the mean number of tokens in a place, the mean number of firing transition ... We have so developped a tool, SSPN (Stochastic Symetric Petri nets), for generating the symbolic graph and deducing qualitatives and quantitatives properties.

Type
Research Article
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)