For the most recent entries see the Petri Nets Newsletter.

Syntactical Colored Petri Nets Reductions.

Evangelista, S.; Haddad, S.; Pradat-Peyre, J.-F.

In: Doron A. Peled, Yih-Kuen Tsay (Eds.): Lecture Notes in Computer Science, 3707: Automated Technology for Verification and Analysis: Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005., pages 202-216. Springer-Verlag, October 2005. URL:,.

Abstract: 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.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography