Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, II
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
A symbolic semantics for the &pgr;-calculus
Information and Computation
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Temporal Concurrent Constraint Programming Calculus
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Semirings in operations research and computer science: more algebra
Fundamenta Informaticae
Theoretical Computer Science - Mathematical foundations of computer science 2000
Enhancing constraints manipulation in semiring-based formalisms
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
Structured Communications with Concurrent Constraints
Trustworthy Global Computing
A Symbolic Semantics for a Calculus for Service-Oriented Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Concurrent and reactive constraint programming
A 25-year perspective on logic programming
Sessions and session types: an overview
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering
CC-Pi: a constraint language for service negotiation and composition
Rigorous software engineering for service-oriented systems
Efficient computation of program equivalence for confluent concurrent constraint programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous communication paradigm of process calculi with the constraint handling mechanism of concurrent constraint programming. While in the original presentation of the calculus a reduction semantics has been proposed, in this work we investigate the abstract semantics of cc-pi processes. First, we define a labelled transition system of the calculus and a notion of open bisimilarity à la pi-calculus that is proved to be a congruence. Next, we give a symbolic characterisation of bisimulation and we prove that the two semantics coincide. Essentially, two processes are open bisimilar if they have the same stores of constraints - this can be statically checked - and if their moves can be mutually simulated. A key idea of the symbolic transition system is to have 'contextual' labels, i.e. labels specifying that a process can evolve only in presence of certain constraints. Finally, we show that the polyadic Explicit Fusions calculus introduced by Gardner and Wischik can be translated into monadic cc-pi and that such a transition preserves open bisimilarity. The mapping exploits fusions and tuple unifications as constraints.