How to model and verify concurrent algorithms for distributed CSPs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1894, Issue , 2000, Pages 510-514

  Hannebauer, Markus ^a  

^a GMD   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; PETRI NETS;

ALGEBRAIC PETRI NETS; CONCURRENT ALGORITHMS; CONSISTENCY PROPERTY; DISTRIBUTED AGREEMENT; DISTRIBUTED CONSTRAINT SATISFACTION PROBLEM; LIVENESS PROPERTIES; MODELING AND VERIFICATIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 0003505294     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_40     Document Type: Conference Paper

References (6)

1. M. Hannebauer. Their problems are my problems - The transition between internal and external conflict. In Conflicting Agents: Conflict Management in Multi-Agent Systems. Kluwer, 2000.
2. T. Nguyen, Y. Deville. A distributed arc-consistency algorithm. Science of Computer Programming, 30(1-2): 227-250, 1998.
3. W. Reisig. Elements of Distributed Algorithms - Modeling and Analysis with Petri Nets. Springer, 1998.
4. G. Solotorevsky, E. Gudes, A. Meisels. Modeling and solving distributed constraint satisfaction problems (DCSPs). In Proc. of CP-96, 1996.
5. M. Yokoo, E. Durfee, T. Ishida, K. Kuwabara. The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Trans. KDE, 10(5), 1998.
6. Y. Zhang, A. Mackworth. Parallel and distributed algorithms for finite constraint satisfaction problems. In Proc. of the IEEE-Symposium on Parallel and Distributed Processing, pages 394-397, 1991.