Thumbnail - Request a copy

Syntactical Colored Petri Nets Reductions

Evangelista, Sami; Haddad, Serge; Pradat-Peyre, Jean-François (2005), Syntactical Colored Petri Nets Reductions, dans Peled, Doron A.; Yih-Kuen, Tsay, Automated Technology for Verification and Analysis Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings, Springer : Berlin, p. 202-216. http://dx.doi.org/10.1007/11562948_17

Type
Communication / Conférence
Date
2005
Titre du colloque
Third International Symposium on Automated Technology for Verification and Analysis, ATVA 2005
Date du colloque
2005-10
Ville du colloque
Taipei
Pays du colloque
Taïwan
Titre de l'ouvrage
Automated Technology for Verification and Analysis Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings
Auteurs de l’ouvrage
Peled, Doron A.; Yih-Kuen, Tsay
Éditeur
Springer
Titre de la collection
Lecture Notes in Computer Science
Numéro dans la collection
3707
Ville d’édition
Berlin
Isbn
978-3-540-29209-8
Nombre de pages
506
Pages
202-216
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Evangelista, Sami
Haddad, Serge
Pradat-Peyre, Jean-François
Résumé (EN)
In this paper, we develop a syntactical version of elaborated reductions for high-level Petri nets. These reductions simplify the model by merging some sequential transitions into an atomic one. Their conditions combine local structural ones (e.g. related to the actions of a thread) and global algebraic ones (e.g. related to the threads synchronization). We show that these conditions are performed in a syntactical way, when a syntax of the color mappings is given. We show also how our method outperforms previous ones on a recent case study with regard both to the reduction ratio and the automatization of their application.
Mots-clés
Petri nets