Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad, āOn Well-formed coloured Nets and their Symbolic Reachability Graphā, proceedings 11th International Conference on Application and Theory of Petri Nets, Paris, France, Juin 1990.
Chiola G., Franceschinis G., Gaeta R., āA symbolic simulation mechanism for Well-Formed Coloured Petri Netsā. In proc. of the 25th simulation symposium, Orlando, Florida, 1992.
Dutheillet C., Haddad S., āAggregation and Disaggregation of States in Colored Stochastic Petri Nets: Application to a Multiprocessor Architectureā, proceedings 3rd International Workshop on Petri Nets and Performance Models, IEEE-CS Press, Kyoto, Japan, Juillet 1989.
Dutheillet C., āSymĆ©tries dans les rĆ©seaux colorĆ©s, dĆ©finition, analyse et application Ć de performanceā, ThĆØse de doctorat de l'universitĆ© de Paris VI, Mars 1992.
Genrich H.J., āPredicate / Transition Netsā. In High-level Petri Nets. Theory and Application, K. Jensen and G. Rozenberg eds., Springer-Verlag, 1991, pp 3ā43.
Haddad S., āUne catĆ©gorie rĆ©guliĆØre de rĆ©seaux de Petri de haut-niveau: dĆ©finition, propriĆ©tĆ©s et rĆ©ductionsā, ThĆØse de doctorat de l'universitĆ© de PARIS VI; Octobre 1987.
Haddad S., IliĆ© J-M, Zouari B., āA Reduced State Graph for Symmetrical Protocolsā, Rapport de recherche, Institut Blaise Pascal RR 92-57. Septembre 1992.
Huber P., Jensen A.M., Jepsen L.O., Jensen K., ā Reachability Trees for High-Level Petri Netsā, TCS 45, North Holland, pp 261ā292, 1986.
Jensen K.,āHigh-Level Petri netsā, Proceedings of the 3rd European Workshop on Application and Theory of Petri Nets, Varenna, Italy, 1982.
Jensen K., āHigh-Level Petri nets. A combination of Predicate/transition nets and coloured netsā; advanced course on Petri nets. Bad Honnef (1986).
Zouari B., āMethodes de SpĆ©cification et de vĆ©rification de Protocoles de Communicationā; ThĆØse de doctorat de l'universitĆ© de Paris VI, MASI 93.04, Janvier 1993.
Haddad S., IliĆ© J.M., Taghelit M., Zouari B., āSymbolic Reachability graph And Partial Symmetriesā, tech. report of Masi lab., P.&M. Curie University, Paris, nā95.30, Mars 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
Ā© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haddad, S., IliƩ, J.M., Taghelit, M., Zouari, B. (1995). Symbolic reachability graph and partial symmetries. In: De Michelis, G., Diaz, M. (eds) Application and Theory of Petri Nets 1995. ICATPN 1995. Lecture Notes in Computer Science, vol 935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60029-9_43
Download citation
DOI: https://doi.org/10.1007/3-540-60029-9_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60029-9
Online ISBN: 978-3-540-49408-9
eBook Packages: Springer Book Archive