Symbolic reachability graph and partial symmetries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 935, Issue , 1995, Pages 238-257

  Haddad, S ^a   Ilie J M ^b   Taghelit, M ^a   Zouari, B ^c  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^c FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

Author keywords

Partial symmetries; Symbolic reachability graphs; Well formed petri nets

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EXTENDED SYMBOLIC REACHABILITY GRAPHS; HIGH-LEVEL PETRI NETS; PARTIAL SYMMETRIES; REACHABILITY; STATE EXPLOSION; SYMBOLIC REACHABILITY;

PETRI NETS;

EID: 35248819432     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60029-9_43     Document Type: Conference Paper

References (12)

1. 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.
2. 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.
3. 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.
4. Dutheillet C., "Symétries dans les réseaux colorés, définition, analyse et application à de performance," These de doctorat de l'université de Paris VI, Mars 1992.
5. 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.
6. Haddad S., "Une catégorie régulière de réseaux de Petri de haut-niveau: definition, propriétés et reductions," These de doctorat de l'université de PARIS VI; Octobre 1987.
7. 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.
8. 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.
9. Jensen K.," High-Level Petri nets," Proceedings of the 3rd European Workshop on Application and Theory of Petri Nets, Varenna, Italy, 1982.
10. Jensen K., "High-Level Petri nets. A combination of Predicate/transition nets and coloured nets"; advanced course on Petri nets. Bad Honnef (1986).
11. Zouari B., "Methodes de Specification et de verification de Protocoles de Communication"; These de doctorat de l'université de Paris VI, MASI 93. 04, Janvier 1993.
12. 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.