Sciweavers

129
Voted
ATVA
2005
Springer
80views Hardware» more  ATVA 2005»

Syntactical Colored Petri Nets Reductions

15 years 11 months ago
Syntactical Colored Petri Nets Reductions
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.
Sami Evangelista, Serge Haddad, Jean-Franço
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where ATVA
Authors Sami Evangelista, Serge Haddad, Jean-François Pradat-Peyre
Comments (0)