Communicating sequential processes
Communicating sequential processes
Statecharts: A visual formalism for complex systems
Science of Computer Programming
LUSTRE: a declarative language for real-time programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communications of the ACM
Coordination languages and their significance
Communications of the ACM
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fully abstract denotational models for nonuniform concurrent languages
Information and Computation
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Control flow semantics
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
The Failure of Failures in a Paradigm for Asynchronous Communication
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Modeling Coordination via Asynchronous Communication
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
IBM Systems Journal
On the expressiveness of timed coordination models
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Towards a theory of refinement in timed coordination languages
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
| Hi-index | 5.23 |
Coordination languages and models promote the idea of separating computation and interaction aspects. As for traditional concurrency models, the question of safely replacing an agent by another one in any interacting context naturally appears. This paper proposes two tools to answer that question. On the one hand, a fully abstract semantics allows us to identify two processes which behave similarly in any context. On the other hand, a refinement theory allows us to compare processes that appear to be different in view of the fully abstract semantics but which satisfy the substitutability property: if the implementation I refines the specification S and if C[S] is deadlock free, for some context C, then C[I] is also deadlock free. Both theories are novel, are exposed in the context of our timed coordination languages but may actually be transposed in the context of almost any data-driven coordination language.