Channel-based coordination via constraint satisfaction
From MaRDI portal
Publication:541681
DOI10.1016/j.scico.2010.05.004zbMath1220.68049OpenAlexW1976704523MaRDI QIDQ541681
Dave Clarke, Alexander Lazovik, Farhad Arbab, José Proença
Publication date: 7 June 2011
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2010.05.004
Theory of programming languages (68N15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Timed default concurrent constraint programming
- Universal coalgebra: A theory of systems
- Truly concurrent constraint programming
- Abstract behavior types: a foundation model for components and their composition
- Connector colouring. I: Synchronisation and context dependency
- Modeling component connectors in Reo by constraint automata
- Connector Rewriting with High-Level Replacement Systems
- Tiles for Reo
- Principles of Constraint Programming
- Coordination: Reo, Nets, and Logic
- Reo: a channel-based coordination model for component composition
- Composition of Interacting Computations
- Synthesis of Reo Circuits from Scenario-based Specifications
- Deconstructing <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">R</mml:mi><mml:mi mathvariant="sans-serif">eo</mml:mi></mml:math>
- Generative communication in Linda
- On Resource-Sensitive Timed Component Connectors
- From Propositional Satisfiability to Satisfiability Modulo Theories
- A Language for Task Orchestration and Its Semantic Properties
- Global Computing. Programming Environments, Languages, Security, and Analysis of Systems
This page was built for publication: Channel-based coordination via constraint satisfaction
