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
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