A. Benveniste, B. Caillaud, P. Le Guernic. From synchrony to asynchrony. International Conference on Concurrency Theory. Lectures Notes in Computer Science. Springer, 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[7] the author considers the distribution of synchronous automata on asynchronous networks using Fifo buffered broadcast communications. In [4] a model for the distribution of synchronous programs on distributed architectures is introduced which uses low level non blocking oneplace buffers. In [2], Ban extensive analysis of the links between synchrony and asynchrony is presented in the context of synchronous transition systems (Sts) and the general notion of isochrony is introduced. In [12] an implementation of communicating reactive systems with multiple clocks using Esterel is ....

A. Benveniste, B. Caillaud, P. Le Guernic. From synchrony to asynchrony. International Conference on Concurrency Theory. Lectures Notes in Computer Science. Springer, 1999.

....in [7] establishes precise relations between so called well clocked synchronous functional programs and the subset of Kahn networks amenable to buffer less evaluation. Since then, the issue of synchronous program desynchronization has been investigated by several authors, e.g. [4]. Taking advantage of the rich background of the synchronous programming technology for the purpose of engineering reactive and distributed systems, we cast the theory 4 of synchronous programming and desynchronization in the age of mobility and present a model, consisting of pre order ....

....asynchronous data flow networks. A first formal study [7] established a precise relation between well clocked synchronous functional programs and the subset of Kahn networks amenable to buffer less evaluation. Since then, the issue of desynchronization has been investigated by several authors. In [4], an extensive analysis of the links between synchrony and asynchrony was provided. The proposed vision of asynchrony encompasses distributed systems, in which no global synchronization state is available and communications are not instantaneous. This extension allows to handle incomplete designs, ....

[Article contains additional citation context not shown here]

A. Benveniste, B. Caillaud, P. Le Guernic. From synchrony to asynchrony. International Conference on Concurrency Theory. Lectures Notes in Computer Science. Springer Verlag, 1999.

....des phnomnes de gigue non dterministes. Se pose alors le problme de la validation de tels systmes, tant entendu que cette validation doit tre globale pour l ensemble du systme distribu et doit prendre en considration l asynchronisme inhrent celuici. Une approche explore rcemment par A. Benveniste [2] et par Dassault Aviation [5] consiste spcifier un systme global, dans un formalisme synchrone (en l occurrence SIGNAL et ESTEREL) puis, dans un deuxime temps, morceler ce systme (par des techniques de compilation spare) pour le distribuer sur un rseau de calculateurs. Ce faisant, cette approche ....

A. Benveniste, B. Caillaud, et P. Le Guernic. From synchrony to asynchrony. 10th International Conference on Concurrency Theory, CONCUR'99, Lecture Notes in Computer Science, vol. 1664, pages 162--177, 1999.

....in [7] establishes precise relations between so called well clocked synchronous functional programs and the subset of Kahn networks amenable to ibuoeer lessj evaluation. Since then, the issue of synchronous program idesynchronizationj has been investigated by several authors, e.g. [4]. Taking advantage of the rich background of the synchronous programming technology for the purpose of engineering reactive and distributed systems, we cast the theory 4 of synchronous programming and desynchronization in the age of mobility and present a model, consisting of pre order ....

....asynchronous data AEow networks. A rst formal study [7] established a precise relation between well clocked synchronous functional programs and the subset of Kahn networks amenable to buoeer less evaluation. Since then, the issue of desynchronization has been investigated by several authors. In [4], an extensive analysis of the links between synchrony and asynchrony was provided. The proposed vision of asynchrony encompasses distributed systems, in which no global synchronization state is available and communications are not instantaneous. This extension allows to handle incomplete designs, ....

[Article contains additional citation context not shown here]

A. Benveniste, B. Caillaud, P. Le Guernic. From synchrony to asynchrony. International Conference on Concurrency Theory. Lectures Notes in Computer Science. Springer Verlag, 1999.

....major feature. These requirements are typically not satisfied by existing synchronous languages. However, the Signal language offers solutions for requirement (b) thanks to its relational nature : incomplete designs are encompassed [4] Recent techniques for semantic preserving desynchronization [5] have been developed for synchronous languages, which are in part implemented for Signal, we shall build on this for satisfying requirement (a) As for requirements (c) and (d) no satisfactory solution is provided yet. In particular, while Signal provides solutions for (a) and (b) it is ....

....depicted in the example of the arbiter) For this matter, we propose a new formalism, Bdl, and its semantics, based on the notion of pre order transition systems. We successfuly achieve to fulfill requirements (a) d) a) Bdl fully implements the theory of desynchronization presented in [5]. Bdl specifications have both a synchronous and an asynchronous semantics associated with them. While these semantics generally behave very differently, in particular when parallel composition is considered, conditions ensuring equivalence of these two semantics are stated, which can be checked ....

[Article contains additional citation context not shown here]

A. Benveniste, B. Caillaud, and P. Le Guernic. From synchrony to asynchrony. International Conference on Concurrency Theory. Lectures Notes in Computer Science. Springer Verlag, 1999.

....major feature. These requirements are typically not satisfied by existing synchronous languages. However, the Signal language offers solutions for requirement (b) thanks to its relational nature : incomplete designs are encompassed [4] Recent techniques for semantic preserving desynchronization [5] have been developed for synchronous languages, which are in part implemented for Signal, we shall build on this for satisfying requirement (a) As for requirements (c) and (d) no satisfactory solution is provided yet. In particular, while Signal provides solutions for (a) and (b) it is ....

....depicted in the example of the arbiter) For this matter, we propose a new formalism, Bdl, and its semantics, based on the notion of pre order transition systems. We successfuly achieve to fulfill requirements (a) d) a) Bdl fully implements the theory of desynchronization presented in [5]. Bdl specifications have both a synchronous and an asynchronous semantics associated with them. While these semantics generally behave very differently, in particular when parallel composition is considered, conditions ensuring equivalence of these two semantics are stated, which can be checked ....

[Article contains additional citation context not shown here]

A. Benveniste, B. Caillaud, and P. Le Guernic. From synchrony to asynchrony. International Conference on Concurrency Theory. Lectures Notes in Computer Science. Springer Verlag, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC