In: Cosnard, M.; et al.: Decentralized Systems. Proceedings of the IFIP WG 10.3 Working Conference, 1989, Lyon, France, pages 337-348. Amsterdam, Netherlands: North-Holland, 1990.
Abstract: The paper shows how colored Petri nets are well-suited to describe and prove distributed control algorithms. The authors are interested in algorithms that use control structures which are based on a sequence of phases and on diffusing computation. Among these algorithms, they choose an algorithm for synchronizing logical clocks and routing algorithms. They model them by using their restricted colored Petri nets. They prove them by using an original analysis method developed for this kind of nets. This method allows them to find some invariance properties that can not be found by classical methods.
Keywords: distributed control algorithm; restricted coloured net; diffusing computation; logical clock; routing algorithm.
Back to the Petri Nets Bibliography