Communicating reactive processes

Berry, Gérard; Ramesh, S.; Shyamasundar, R. K.

doi:10.1145/158511.158526

Cited by 94 publications

(44 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several approaches were suggested to map synchronous systems into this framework, for instance, [Ben01,PBC07]. Related approaches include Communicating Reactive Processes [BRS93], in which synchronous modules communicate via CSP rendezvous and Multiclock Esterel [BS01], which substitutes local clocks for a global one.…”

Section: Relating Synchrony and Asynchronymentioning

confidence: 99%

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: Relating Synchrony and Asynchronymentioning

confidence: 99%

On the Compositionality of Round Abstraction

Ghica

Menaa

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

show abstract

“…partial orders, compositional minimization, etc.). Other approaches extend synchronous languages to allow a certain degree of asynchrony, as in Crp [2], Crsm [28], or multiclock Esterel [4], but, to our knowledge, such extensions are not (yet) used in industry. Finally, we can mention approaches [13,27] in which synchronous programs are compiled and distributed automatically over a set of processors running asynchronously; although these approaches allow the generation of Gals implementations, they do not address the issue of modelling and verifying Gals systems.…”

Section: Introductionmentioning

confidence: 99%

Verification of GALS Systems by Combining Synchronous Languages and Process Calculi

Garavel

Thivolle

2009

Model Checking Software

View full text Add to dashboard Cite

Abstract. A Gals (Globally Asynchronous Locally Synchronous) system typically consists of a collection of sequential, deterministic components that execute concurrently and communicate using slow or unreliable channels. This paper proposes a general approach for modelling and verifying Gals systems using a combination of synchronous languages (for the sequential components) and process calculi (for communication channels and asynchronous concurrency). This approach is illustrated with an industrial case-study provided by Airbus: a Tftp/Udp communication protocol between a plane and the ground, which is modelled using the Eclipse/TopCased workbench for model-driven engineering and then analysed formally using the Cadp verification and performance evaluation toolbox.

show abstract

“…In [4,8,2], a paradigm referred to as Communicating Reactive Processes (CRP) that provides a unification of perfect synchrony and asynchrony has been proposed. CRP explicitly distinguishes the parallelism at the network layer and ESTEREL layer.…”

Section: Introductionmentioning

confidence: 99%

Modeling Distributed Embedded Systems In Multiclock Esterel

Rajan¹,

Shyamasundar

2000

IFIP Advances in Information and Communication Technology

Self Cite

View full text Add to dashboard Cite

In this paper, we show that the paradigm of Multiclock EsTEREL can be effectively used for the design of asynchronously communicating distributed systems. First we show that the protocol used in MulticlockEsTEREL for the modeling of VHDL can be used for the design of asynchronous interaction of processes, and an analysis can be made relative to speed or periodicity of the underlying processes for a safe implementation without missing any signals. The analysis also shows that one can arrive at a tradeoff between the periodicity and the buffer requirements on the average over a sequence of periods. Then, we illustrate the modeling of communicating reactive processes (which is essentially a network of EsTEREL nodes communicating via the rendezvous mechanism) as an instance of Multiclock EsTEREL.

show abstract

Communicating reactive processes

Cited by 94 publications

References 10 publications

On the Compositionality of Round Abstraction

On the Compositionality of Round Abstraction

Verification of GALS Systems by Combining Synchronous Languages and Process Calculi

Modeling Distributed Embedded Systems In Multiclock Esterel

Contact Info

Product

Resources

About