The SL synchronous language, revisited

Amadio, Roberto M.

doi:10.1016/j.jlap.2006.08.001

Cited by 6 publications

(13 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The linguistic complexity of the resulting language is comparable to the one of the π-calculus and we tentatively call it the Sπ-calculus (pronounced s − pi). 1 Our contribution is to show that the notion of bisimulation equivalence introduced in [1] is sufficiently robust to be lifted from the deterministic language with pure signals to the non-deterministic language with data types and signal name generation. The main role in this story is played by a new notion of labelled bisimulation.…”

Section: Introductionmentioning

confidence: 99%

A synchronous π-calculus

Amadio

2007

Information and Computation

Self Cite

View full text Add to dashboard Cite

The SL synchronous programming model is a relaxation of the Esterel synchronous model where the reaction to the absence of a signal within an instant can only happen at the next instant. In previous work, we have revisited the SL synchronous programming model. In particular, we have discussed an alternative design of the model, introduced a CPS translation to a tail recursive form, and proposed a notion of bisimulation equivalence. In the present work, we extend the tail recursive model with first-order data types obtaining a non-deterministic synchronous model whose complexity is comparable to the one of the π-calculus. We show that our approach to bisimulation equivalence can cope with this extension and in particular that labelled bisimulation can be characterised as a contextual bisimulation. * Partially supported by ANR-06-SETI-010-02. † Laboratoire Preuves, Programmes et Systèmes, UMR-CNRS 7126.

show abstract

Section: Introductionmentioning

confidence: 99%

A synchronous π-calculus

Amadio

2007

Information and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…(1) The clauses in the definition of ≈ u imply directly those in the definition of the labelled bisimulation that characterises ≈ (definition 3.1). To see that the converse fails note that (a | Ω) ≈ Ω while (a | Ω) ≈ u Ω.…”

Section: Embedding Ccs In Tccsmentioning

confidence: 99%

On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS

Amadio

2009

Electronic Notes in Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

We propose a notion of convergence-sensitive bisimulation that is built just over the notions of (internal) reduction and of (static) context. In the framework of timed CCS, we characterise this notion of 'contextual' bisimulation via the usual labelled transition system. We also remark that it provides a suitable semantic framework for a fully abstract embedding of untimed processes into timed ones. Finally, we show that the notion can be refined to include sensitivity to divergence.

show abstract

“…Proof. (1) The identity relation is a labelled bisimulation and the union of symmetric relations is symmetric. To check transitivity, we prove that ≈ • ≈ is a labelled bisimulation by standard diagram chasing.…”

Section: A Basic Properties Of Labelled Bisimulationmentioning

confidence: 99%

Determinacy in a synchronous π-calculus

Amadio¹,

Dogguy²

2009

From Semantics to Computer Science

Self Cite

View full text Add to dashboard Cite

The Sπ-calculus is a synchronous π-calculus which is based on the SL model. The latter is a relaxation of the Esterel model where the reaction to the absence of a signal within an instant can only happen at the next instant. In the present work, we present and characterise a compositional semantics of the Sπ-calculus based on suitable notions of labelled transition system and bisimulation. Based on this semantic framework, we explore the notion of determinacy and the related one of (local) confluence. * Work partially supported by ANR-06-SETI-010-02.3. We provide local confluence conditions that are easier to check and that combined with reactivity turn out to be equivalent to determinacy.We briefly trace the path that has lead to this approach. A systematic study of determinacy and confluence for CCS is available in [17] where, roughly, the usual theory of rewriting is generalised in two directions: first rewriting is labelled and second diagrams commute up to semantic equivalence. In this context, a suitable formulation of Newman's lemma [19], has been given in [11]. The theory has been gradually extended from CCS, to CCS with values, and finally to the π-calculus [20].Calculi such as CCS and the π-calculus are designed to represent asynchronous systems. On the other hand, the Sπ-calculus is designed to represent synchronous systems. In these systems, there is a notion of instant (or phase, or pulse, or round) and at each instant each thread performs some actions and synchronizes with all other threads. One may say that all threads proceed at the same speed and it is in this specific sense that we will refer to synchrony in this work.In order to guarantee determinacy in the context of CCS rendez-vous communication, it seems quite natural to restrict the calculus so that interaction is point-to-point, i.e., it involves exactly one sender and one receiver. 1 In a synchronous framework, the introduction of signal based communication offers an opportunity to move from point-to-point to a more general multi-way interaction mechanism with multiple senders and/or receivers, while preserving determinacy. In particular, this is the approach taken in the Esterel and SL [8] models. The SL model can be regarded as a relaxation of the Esterel model where the reaction to the absence of a signal within an instant can only happen at the next instant. This design choice avoids some paradoxical situations and simplifies the implementation of the model. The SL model has gradually evolved into a general purpose programming language for concurrent applications and has been embedded in various programming environments such as C, Java, Scheme, and Caml (see [7, 22,16]). For instance, the Reactive ML language [16] includes a large fragment of the Caml language plus primitives to generate signals and synchronise on them. We should also mention that related ideas have been developed by Saraswat et al. [21] in the area of constraint programming.The Sπ-calculus can be regarded as an extension of the SL model where signals can carry valu...

show abstract

The SL synchronous language, revisited

Cited by 6 publications

References 20 publications

A synchronous π-calculus

A synchronous π-calculus

On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS

Determinacy in a synchronous π-calculus

Contact Info

Product

Resources

About