How to model and verify concurrent algorithms for distributed CSPs

DOI10.1007/3-540-45349-0_40MaRDI QIDQ4473052zbMATH OpenFDO

Authors Markus Hannebauer

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1894/18940510.htm

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Recommendations

• Concurrent search for distributed CSPs
• Modelling and verification of Distributed Algorithms
• Distributed constraint satisfaction with cooperating asynchronous solvers
• Constraint satisfaction in distributed concurrent logic programming
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(2)

• Implementations of the CSP Notation for Concurrent Systems
• Modelling and verification of Distributed Algorithms

This page was built for publication: How to model and verify concurrent algorithms for distributed CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473052)