Channel-based coordination via constraint satisfaction
type: Item
instance of: scholarly article
title: Channel-based coordination via constraint satisfaction
zbMATH Open document ID: 1220.68049
author: Dave Clarke
author: José Proença
author: Alexander Lazovik
author: Farhad Arbab
published in: Science of Computer Programming
publication date: 2011-06-07T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5905033
zbMATH Keywords: coordination
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: constraint automata
zbMATH Keywords: \(\mathcal R\)eo
zbMATH Keywords: connector colouring
describes a project that uses: Reo
describes a project that uses: Linda
MaRDI profile type: Publication
full work available at URL: j.scico.2010.05.004
OpenAlex ID: W1976704523
cites work: Principles of Constraint Programming
cites work: Reo: a channel-based coordination model for component composition
cites work: Abstract behavior types: a foundation model for components and their composition
cites work: Composition of Interacting Computations
cites work: Tiles for Reo
cites work: Synthesis of Reo Circuits from Scenario-based Specifications
cites work: Modeling component connectors in Reo by constraint automata
cites work: Global Computing. Programming Environments, Languages, Security, and Analysis of Systems
cites work: Coordination: Reo, Nets, and Logic
cites work: Q5457269
cites work: Connector colouring. I: Synchronisation and context dependency
cites work: Deconstructing R eo
cites work: Generative communication in Linda
cites work: A Language for Task Orchestration and Its Semantic Properties
cites work: Connector rewriting with high-level replacement systems
cites work: On Resource-Sensitive Timed Component Connectors
cites work: Q4248252
cites work: Universal coalgebra: A theory of systems
cites work: Truly concurrent constraint programming
cites work: Timed default concurrent constraint programming
cites work: From Propositional Satisfiability to Satisfiability Modulo Theories
DOI: 10.1016/J.SCICO.2010.05.004
Recommended article: Q4738171
Recommended article: A multi‐agent approach for dynamic channel allocation
Recommended article: Approximation algorithms for channel assignment with constraints
Recommended article: Q4511237
Recommended article: Q4424864
Recommended article: Q3171169
Recommended article: Q4363193
Recommended article: Constraint-based protocols for distributed problem solving
description: scientific article; zbMATH DE number 5905033