How to Model and Verify Concurrent Algorithms for Distributed CSPs

Authors:
Markus Hannebauer
Affiliations:
-
Venue:
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Year:
2000

Citing 4
Cited 0

A distributed arc-consistency algorithm

Science of Computer Programming - Special issue on concurrent constraint programming
Elements of distributed algorithms: modeling and analysis with Petri nets

Elements of distributed algorithms: modeling and analysis with Petri nets
Their problems are my problems: the transition between internal and external conflicts

Conflicting agents
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

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.