Towards a theory of refinement in timed coordination languages

Authors:
Jean-Marie Jacquet;Isabelle Linden
Affiliations:
Institute of Informatics, FUNDP, University of Namur;Institute of Informatics, FUNDP, University of Namur
Venue:
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Year:
2007

Citing 18
Cited 1

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
Linda in context

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)
The B-book: assigning programs to meanings

The B-book: assigning programs to meanings
Control flow semantics

Control flow semantics
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
A Calculus of Communicating Systems

A Calculus of Communicating Systems
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
Modeling Coordination via Asynchronous Communication

COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
T spaces

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)
Fully Abstract Semantics for a Coordination Model with Asynchronous Communication and Enhanced Matching

Fundamenta Informaticae

Fully abstract models and refinements as tools to compare agents in timed coordination languages

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Building upon previous work on timed coordination languages, this paper presents a novel notion of refinement for these languages which satisfies 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.