A refinement calculus for tuple spaces

Semini, Laura; Montangero, Carlo

doi:10.1016/s0167-6423(98)00021-5

Cited by 6 publications

(2 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To our best knowledge, the article [30] is the only piece of work which has developed a refinement theory in the context of coordination languages. However, this work takes the complementary perspective of using a first order temporal logic to write specifications and of employing an axiomatic semantics to derive properties.…”

Section: Resultsmentioning

confidence: 99%

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

Jacquet¹,

Linden²

2009

Theoretical Computer Science

View full text Add to dashboard Cite

a b s t r a c tCoordination 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.

show abstract

Section: Resultsmentioning

confidence: 99%

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

Jacquet¹,

Linden²

2009

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Notable examples in this direction can be found in the context of the Microsoft .NET initiative, like the introduction of support for the delegate-based asynchronous calling model in the libraries of the Common Language Runtime [25], and the proposal of chords in Polyphonic C# to accommodate asynchronous methods in C# [32]. We provide an example of coverage of asynchronous communication in coordination and specification languages in [29].…”

Section: Introductionmentioning

confidence: 99%

Distributed states logic

Montangero

Semini

Proceedings Ninth International Symposium on Temporal Representation and Reasoning

View full text Add to dashboard Cite

We introduce a temporal logic to reason on global applications in an asynchronous setting. First, we define the Distributed States Logic (DSL), a modal logic for localities that embeds the local theories of each component into a theory of the distributed states of the system. We provide the logic with a sound and complete axiomatization. The contribution is that it is possible to reason about properties that involve several components, even in the absence of a global clock. Then, we define the Distributed States Temporal Logic (DSTL) by introducing temporal operatorsà la Unity. We support our proposal by working out a pair of examples: a simple secure communication system, and an algorithm for distributed leader election. The motivation for this work is that the existing logics for distributed systems do not have the right expressive power to reason on the systems behaviour, when the communication is based on asynchronous message passing. On the other side, asynchronous communication is the most used abstraction when modelling global applications.

show abstract