In: LNCS 1894: Principles and Practice of Constraint Programming - CP 2000, pages 510-pp. 6th International Conference, CP 2000, Singapore, September 2000. Proceedings / Rina Dechter (Ed.) --- Springer Verlag, 2000.
Abstract: Many recent systems tackling Distributed Constraint Satisfaction Problems (DCSPs) lack a theoretically founded specification and safety or liveness property proofs. This may be due to the difficulty of modeling and verifying concurrently running threads and their interaction. In this article we will briefly sketch an approach to the modeling and verification of concurrent algorithms tailored to DCSP solving and based on algebraic Petri nets. We will present a realistic case study on distributed agreement finding and state according termination and consistency properties.
Back to the Petri Nets Bibliography