In: J.-M. Colom, M. Koutny (Eds.), Newcastle upon Tyne, UK: Proc. of 22nd International Conf. on Applications and Theory of Petri Nets 2001 (ICATPN 2001), pages 121-143. Lecture Notes in Computer Science 2075, edited by G. Goos, J. Hartmanis and J. van Leuwen, Springer, June 2001.
Abstract: This paper presents a general technique for the modular construction of complete prefixes adapted to systems composed of Petri nets. This construction is based on a definition of a well-adapted order allowing combination. Moreover, the proposed technique takes into account the symmetries of the system to minimize the size of the produced complete prefixes. Finally, the technique has been instantiated in an efficient algorithm for systems combining finite state machines and k-bounded