Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-24T03:55:07.390Z Has data issue: false hasContentIssue false
  • English
  • Français

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  and
A. Aissani
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 forconstruction of the reduced reachability graph for Stochastic Petri Nets(SPN), the symbolic graph. This construction is achieved by exploitingthe structural symetries in the net using the theory of bisimulation ofplaces for detecting isomorphic parts in the net. The symbolic graph,being isomorphic to an agregated Markov chain, may be used to provequalitative properties as liveness, boundness, ... Moreover, thisreduced graph make more easy the computation of the performance measuresof interest as the mean number of tokens in a place, the mean number offiring transition ... We have so developped a tool, SSPN (StochasticSymetric Petri nets), for generating the symbolic graph and deducingqualitatives and quantitatives properties.

Keywords

Symetriesstochastic Petri NetSymbolic Graph.Symétriesréseau de Petri stochastiquegraphe desmarquages accessiblesgraphe des marquages symboliques.
Type
Research Article
Information
RAIRO - Operations Research , Volume 34 , Issue 2 , April 2000 , pp. 237 - 249
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.)