• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Symbolic Reachability Graph and Partial Symmetries

Haddad, Serge; Ilié, Jean-Michel; Taghelit, Mohamed; Zouari, Belhassen (1995), Symbolic Reachability Graph and Partial Symmetries, in De Michelis, Giorgio; Diaz, Michel, Application and Theory of Petri Nets 1995, 16th International Conference, Turin, Italy, June 26-30, 1995, Proceedings, Springer : Berlin, p. 238-257. http://dx.doi.org/10.1007/3-540-60029-9_43

Type
Communication / Conférence
Date
1995
Conference title
Sixteenth International Conference on application and theory of Petri nets (ICATPN 1995)
Conference date
1995-06
Conference city
Turin
Conference country
Italie
Book title
Application and Theory of Petri Nets 1995, 16th International Conference, Turin, Italy, June 26-30, 1995, Proceedings
Book author
De Michelis, Giorgio; Diaz, Michel
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
935
Published in
Berlin
ISBN
3-540-60029-9
Number of pages
511
Pages
238-257
Publication identifier
http://dx.doi.org/10.1007/3-540-60029-9_43
Metadata
Show full item record
Author(s)
Haddad, Serge
Ilié, Jean-Michel
Taghelit, Mohamed
Zouari, Belhassen
Abstract (EN)
The construction of symbolic reachability graphs is a useful technique for reducing state explosion in High-level Petri nets. Such a reduction is obtained by exploiting the symmetries of the whole net [1]. In this paper, we extend this method to deal with partial symmetries. In a first time, we introduce an example which shows the interest and the principles of our method. Then we develop the general algorithm. Lastly we enumerate the properties of this Extended Symbolic Reachability Graph, including the reachability equivalence.
Subjects / Keywords
Well-Formed Petri nets; Symbolic Reachability graphs; Partial Symmetries

Related items

Showing items related by title and author.

  • Thumbnail
    Exploiting Partial Symmetries in Well-formed nets for the Reachability and the Linear Time Model Checking Problems 
    Baarir, Souheib; Haddad, Serge; Ilié, Jean-Michel (2005) Communication / Conférence
  • Thumbnail
    Assessment of ESTELLE and EDT Through Real Case Studies 
    Haddad, Serge; Taghelit, Mohamed; Zouari, Belhassen (1993) Communication / Conférence
  • Thumbnail
    Contribution des réseaux de Petri de haut niveau 
    Haddad, Serge; Ilié, Jean-Michel; Taghelit, Mohamed; Dutheillet, Claude; Moreaux, Patrice (1997) Article accepté pour publication ou publié
  • Thumbnail
    Etude critique de la modélisation et de l'évaluation de protocoles dans un environnement ESTELLE 
    Haddad, Serge; Taghelit, Mohamed; Zouari, Belhassen (1996) Article accepté pour publication ou publié
  • Thumbnail
    A Protocol Specification Language with a High-level Petri Net Semantics 
    Zouari, Belhassen; Taghelit, Mohamed; Haddad, Serge (1993) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo