Sciweavers

Share
APN
2010
Springer

Factorization Properties of Symbolic Unfoldings of Colored Petri Nets

9 years 10 months ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actions. But even small real systems are never modeled directly as ordinary Petri nets: they use many high-level features that were designed as extensions of Petri nets. We focus here on two such features: colors and compositionality. We show that the symbolic unfolding of a product of colored Petri nets can be expressed as the product of the symbolic unfoldings of these nets. This is a necessary result in view of distributed computations based on symbolic unfoldings, as they have been developed already for standard unfoldings, to design modular verification techniques, or modular diagnosis procedures, for example. The factorization property of symbolic unfoldings is valid for several classes of colored or high-level nets. We derive it here for a class of (high-level) open nets, for which the composition is perfo...
Thomas Chatain, Eric Fabre
Added 18 Jul 2010
Updated 18 Jul 2010
Type Conference
Year 2010
Where APN
Authors Thomas Chatain, Eric Fabre
Comments (0)
books