On the expressive power of temporal concurrent constraint programming languages

Mogens Nielsen, Catuscia Palamidessi, Frank D. Valencia

Producción: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

25 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaProceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)
EditorialAssociation for Computing Machinery (ACM)
Páginas156-167
Número de páginas12
ISBN (versión impresa)1581135289, 9781581135282
DOI
EstadoPublicada - 2002
EventoProceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02) - Pittsburg, PA, Estados Unidos
Duración: 06 oct. 200208 oct. 2002

Serie de la publicación

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

Conferencia

ConferenciaProceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)
País/TerritorioEstados Unidos
CiudadPittsburg, PA
Período06/10/0208/10/02

Huella

Profundice en los temas de investigación de 'On the expressive power of temporal concurrent constraint programming languages'. En conjunto forman una huella única.

Citar esto