Dynamic spaces in concurrent constraint programming

Nigam, Vivek; Pimentel, Elaine Gouvea; Vega, Carlos Alberto Olarte

Dynamic spaces in concurrent constraint programming

Página do item simplificado Estatísticas

dc.contributor.author	Nigam, Vivek
dc.contributor.author	Pimentel, Elaine Gouvea
dc.contributor.author	Vega, Carlos Alberto Olarte
dc.date.accessioned	2020-08-03T20:19:57Z
dc.date.available	2020-08-03T20:19:57Z
dc.date.issued	2014
dc.description.resumo	Concurrent constraint programming (CCP) is a declarative model for concurrency where agents interact with each other by posting (telling) and asking constraints (formulas in logic) in a shared store of partial information. With the advent of emergent applications as security protocols, social networks and cloud computing, the CCP model has been extended in different directions to faithfully model such systems as follows: (1) It has been shown that a name-passing discipline, where agents can communicate local names, can be described through the interplay of local (∃) processes along with universally (∀) quantified asks. This strategy has been used, for instance, to model the generation and communication of fresh values (nonces) in mobile reactive systems as security protocols; and (2) the underlying constraint system in CCP has been enhanced with local stores for the specification of distributed spaces. Then, agents are allowed to share some information with others but keep some facts for themselves. Recently, we have shown that local stores can be neatly represented in CCP by considering a constraint system where constraints are built from a fragment of linear logic with subexponentials (SELL). In this paper, we explore the use of existential (⋓) and universal (⋒) quantification over subexponentials in SELL in order to endow CCP with the ability to communicate location (space) names. The resulting CCP language that we obtain is a model of distributed computation where it is possible to dynamically establish new shared spaces for communication. We thus extend the sort of mobility achieved in (1) –for variables – to dynamically change the shared spaces among agents – (2) above. Finally, we argue that the new CCP language can be used in the specification of service oriented computing systems	pt_BR
dc.identifier.citation	OLARTE, Carlos; NIGAM, Vivek; PIMENTEL, Elaine. Dynamic spaces in concurrent constraint programming. Electronic Notes in Theoretical Computer Science, [s.l.], v. 305, p. 103-121, jul. 2014. Disponível em: https://www.sciencedirect.com/science/article/pii/S1571066114000541?via%3Dihub. Acesso em: 30 jul. 2020. https://doi.org/10.1016/j.entcs.2014.06.008	pt_BR
dc.identifier.doi	10.1016/j.entcs.2014.06.008
dc.identifier.issn	1571-0661
dc.identifier.uri	https://repositorio.ufrn.br/jspui/handle/123456789/29778
dc.language	en	pt_BR
dc.publisher	Elsevier	pt_BR
dc.subject	Concurrent Constraint Programming	pt_BR
dc.subject	Linear Logic	pt_BR
dc.subject	Subexponentials	pt_BR
dc.subject	Mobility	pt_BR
dc.subject	Distributed Spaces	pt_BR
dc.title	Dynamic spaces in concurrent constraint programming	pt_BR
dc.type	article	pt_BR