Deriving labels and bisimilarity for concurrent constraint programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Concurrent constraint programming (ccp) is a well-established model for concurrency. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity, however, is not completely satisfactory for ccp since it yields an equivalence that is too fine grained. By building upon recent foundational investigations, we introduce a labelled transition semantics and a novel notion of bisimilarity that is fully abstract w.r.t. the typical observational equivalence in ccp.

Original languageEnglish
Title of host publicationFoundations of Software Science and Computational Structures - 14th Int. Conf., FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Proceedings
PublisherSpringer Verlag
Pages138-152
Number of pages15
ISBN (Print)9783642198045
DOIs
Publication statusPublished - 1 Jan 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6604 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Deriving labels and bisimilarity for concurrent constraint programming'. Together they form a unique fingerprint.

Cite this