Unfolding of Products of Symmetrical Petri Nets
Résumé
This paper presents a general technique for the modular construction ofcomplete prefixes adapted to systems composed ofP etri nets. This construction is based on a definition ofa well-adapted order allowing combination. Moreover, the proposed technique takes into account the symmetries ofthe system to minimize the size ofthe produced complete prefixes. Finally, the technique has been instantiated in an efficient algorithm for systems combining finite state machines and k-bounded queues with k a priori known or not.