• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

A Symbolic Reachability Graph for Coloured Petri Nets

Thumbnail
Date
1997
Dewey
Recherche opérationnelle
Sujet
Modèles mathématiques; Réseaux de Pétri
Journal issue
Theoretical Computer Science
Volume
176
Number
1
Publication date
1997
Article pages
39-65
Publisher
Springer-Verlag
DOI
http://dx.doi.org/10.1016/S0304-3975(96)00010-2
URI
https://basepub.dauphine.fr/handle/123456789/2658
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Chiola, Giovanni
Dutheillet, Claude
Franceschinis, Giuliana
Haddad, Serge
Type
Article accepté pour publication ou publié
Abstract (EN)
Coloured Petri nets are well suited to the modelling of symmetric systems. Model symmetries can be usefully exploited for the sake of analysis efficiency as well as for modelling convenience. We present a reduced reachability graph called symbolic reachability graph that enjoys the following properties: (1) it can be constructed directly by an efficient algorithm without considering the actual state space of the model; (2) it can be substantially smaller than the ordinary reachability graph; (3) its analysis provides equivalent results as the analysis of the ordinary reachability graph. The construction procedure for the symbolic reachability graph is completely effective in the case of a syntactically restricted class of coloured nets called “well-formed nets”, while for the unrestricted case of coloured nets some procedures may not be easily implementable in algorithmic form.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.