Buscemi, Maria Grazia and Montanari, Ugo Open Bisimulation for the Concurrent Constraint Pi-Calculus. In: Proceedings of the 17th European Symposium on Programming (ESOP’08). Lecture Notes in Computer Science, 4960 . Springer, pp. 254-268. ISBN 978-3-540-78738-9 (2008)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Additional Information:||The final publication is available at www.springerlink.com.|
|Funders:||Research supported by the EU IST-FP6 16004 Integrated Project Sensoria.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 29 not found.|
|Date Deposited:||02 Mar 2011 11:26|
|Last Modified:||11 Jul 2011 14:33|
Actions (login required)