Confluence in concurrent constraint programming

Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi

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

9 Citations (Scopus)

Abstract

We investigate the subset of concurrent constraint programs (ccp) which are confluent in the sense that different process schedulings lead to the same possible outcomes. Confluence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible schedulings. The subset of confluent programs is less expressive than tull cop. For example it cannot express fair merge although it can express demonic merge. We give a simple closure based denotational semantics for confluent ccp. We also study admissible programs which is a subset of confluent ccp closed under composition. We consider then applications of our results to give a framework for the efficient yet accurate analysis of full ccp. The basic idea is to approximate an arbitrary ccp program by an admissible program which is then analyzed.

Original languageEnglish
Title of host publicationAlgebraic Methodology and Software Technology - 4th International Conference, AMAST 1995, Proceedings
EditorsV.S. Alagar, Maurice Nivat
PublisherSpringer
Pages531-545
Number of pages15
ISBN (Print)3540600434, 9783540600435
DOIs
Publication statusPublished - 1 Jan 1995
Event4th International Conference on Algebraic Methodology and Software Technology, AMAST 1995 - Montreal, Canada
Duration: 3 Jul 19957 Jul 1995

Publication series

NameLecture Notes in Computer Science
Volume936
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Algebraic Methodology and Software Technology, AMAST 1995
CountryCanada
CityMontreal
Period3/07/957/07/95

Cite this