From Synchrony to Asynchrony

Benveniste, Albert; Caillaud, Benoît; Guernic, Paul Le

doi:10.1007/3-540-48320-9_13

Cited by 55 publications

(48 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Starting with Milner's seminal work in the 1980s, several authors demonstrated how asynchronous models can be derived from [Mil83,BCG99] or simulated by [HM06] their synchronous counterparts. Hence, it is commonly accepted that synchronous models are more expressive.…”

Section: Motivationmentioning

confidence: 99%

“…Even recovering synchronicity after it is removed from a specification is a non-trivial procedure [BCG99].…”

Section: Motivationmentioning

confidence: 99%

“…However, this is unsuitable if what is desired is not just a correct encoding, but one that additionally has a low-latency. This is not easy; even recovering synchronicity after it is removed from a specification is a non-trivial procedure [BCG99].…”

Section: Relating Synchrony and Asynchronymentioning

confidence: 99%

“…In [BCG99], Benveniste et al demonstrated that even recovering synchrony, after it is removed, is nontrivial. A more general answer appears in the work of Alur and Henzinger.…”

Section: Compositional Round Abstraction *mentioning

confidence: 99%

See 3 more Smart Citations

On the Compositionality of Round Abstraction

Ghica

Menaa

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

Game Semantics is an approach to denotational semantics that has been successful in providing accurate, fully abstract models for various programming languages. It has thereafter been applied, amongst other things, to model checking, access control analysis, information flow analysis, and recently, hardware synthesis.While the roots of modern Game Semantics are sequential, several game models of asynchronous concurrency have since been devised. However, synchronous concurrency has not been considered hitherto.This thesis studies synchronous concurrency in game-like models. The central idea is to investigate deriving such synchronous models from their asynchronous counterparts using round abstraction-a technique that allows aggregating a sequence of computational steps to form a larger, more abstract macro-step.We define round abstraction within a trace-semantic setting that generalises game semantic models. We note that, in general, round abstraction is not compositional. We then identify sufficient conditions to guarantee correct composition, thereby proposing a framework for round abstraction that is sound when applied to synchronous and asynchronous behaviours.

show abstract

Section: Motivationmentioning

confidence: 99%

“…Even recovering synchronicity after it is removed from a specification is a non-trivial procedure [BCG99].…”

Section: Motivationmentioning

confidence: 99%

Section: Relating Synchrony and Asynchronymentioning

confidence: 99%

“…In [BCG99], Benveniste et al demonstrated that even recovering synchrony, after it is removed, is nontrivial. A more general answer appears in the work of Alur and Henzinger.…”

Section: Compositional Round Abstraction *mentioning

confidence: 99%

See 2 more Smart Citations

On the Compositionality of Round Abstraction

Ghica

Menaa

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

show abstract

“…Of course, there is a wealth of literature on semantics preservation in heterogeneous networks, cf. [6], [7], [13], [14], and [18], the last of which approaches the problem from a categorical prospective.…”

Section: Introductionmentioning

confidence: 99%

Homogeneous Semantics Preserving Deployments of Heterogeneous Networks of Embedded Systems

Ames

Sangiovanni‐Vincentelli

Sastry

Lecture Notes in Control and Information Science

View full text Add to dashboard Cite

Summary. Tagged systems provide a denotational semantics for embedded systems. A heterogeneous network of embedded systems can be modeled mathematically by a network of tagged systems. Taking the heterogeneous composition of this network results in a single, homogeneous, tagged system. The question this paper addresses is: when is semantics (behavior) preserved by composition? To answer this question, we use the framework of category theory to reason about heterogeneous system composition and derive results that are as general as possible. In particular, we define the category of tagged systems, demonstrate that a network of tagged systems corresponds to a diagram in this category and prove that taking the composition of a network of tagged systems is equivalent to taking the limit of this diagram-thus composition is endowed with a universal property. Using this universality, we are able to derive verifiable necessary and sufficient conditions on when composition preserves semantics.

show abstract