hal-00546857, version 1
Bisimilarity in Concurrent Constraint Programming
26th International Conference on Logic Programming, ICLP 2010 7 (2010) 236-240
Abstract: In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broader capture of processes behavioural equivalence. Moreover, we work towards exploiting the strong connection between rst order logic and CCP. Something which will allow us to represent logical formulae in terms of CCP processes and verify its logical equivalence by means of our notion of bisimilarity. Finally, following the lines of the Concurrecy Workbench we plan to implement a CCP Workbench based on our theoretical structure
- 1: COMETE (INRIA Saclay - Ile de France)
- INRIA – Polytechnique - X – CNRS : UMR7161
- Collaboration : FORCES
- Domain : Computer Science/Distributed, Parallel, and Cluster Computing
- Keywords : Deriving Bisimulations – Concurrent Constraint Programming – Concurrency Theory
- Comment : Short paper accepted at the Doctoral Programme of ICLP'2010
- hal-00546857, version 1
- http://hal.archives-ouvertes.fr/hal-00546857
- oai:hal.archives-ouvertes.fr:hal-00546857
- From: Frank D. Valencia
- Submitted on: Wednesday, 15 December 2010 20:04:51
- Updated on: Wednesday, 19 January 2011 00:24:06
Associated documents
Export