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
TypeCommunication / Conférence
Conference titleSixteenth International Conference on application and theory of Petri nets (ICATPN 1995)
Book titleApplication and Theory of Petri Nets 1995, 16th International Conference, Turin, Italy, June 26-30, 1995, Proceedings
Book authorDe Michelis, Giorgio; Diaz, Michel
Series titleLecture Notes in Computer Science
Number of pages511
MetadataShow full item record
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 . 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 / KeywordsWell-Formed Petri nets; Symbolic Reachability graphs; Partial Symmetries
Showing items related by title and author.
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
Haddad, Serge; Taghelit, Mohamed; Zouari, Belhassen (1996) Article accepté pour publication ou publié