On the expressive power of temporal concurrent constraint programming languages

Mogens Nielsen, Catuscia Palamidessi, Frank D. Valencia

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

25 Scopus citations

Abstract

The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages differing in their way of expressing infinite behavior have been proposed in the literature. In this paper we study the expressive power of some of these languages. In particular, we show that: (1) recursive procedures with parameters can be encoded into parameterless recursive procedures with dynamic scoping, and viceversa. (2) replication can be encoded into parameterless recursive procedures with static scoping, and viceversa. (3) the languages from (1) are strictly more expressive than the languages from (2). Furthermore, we show that behavioral equivalence is undecidable for the languages from (1), but decidable for the languages from (2). The undecidability result holds even if the process variables take values from a fixed finite domain.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)
PublisherAssociation for Computing Machinery (ACM)
Pages156-167
Number of pages12
ISBN (Print)1581135289, 9781581135282
DOIs
StatePublished - 2002
EventProceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02) - Pittsburg, PA, United States
Duration: 06 Oct 200208 Oct 2002

Publication series

NameProceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)

Conference

ConferenceProceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)
Country/TerritoryUnited States
CityPittsburg, PA
Period06/10/0208/10/02

Keywords

  • Constraint programming
  • Expressiveness
  • Timed systems

Fingerprint

Dive into the research topics of 'On the expressive power of temporal concurrent constraint programming languages'. Together they form a unique fingerprint.

Cite this