9 citations found. Retrieving documents...
N. Halbwachs, P. Caspi, and D. Pilaud. The synchronous dataAEow programming language Lustre. Another Look at Real Time Programming, Proceedings of the IEEE, Special Issue, Sept. 1991.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
The Esterel v5 Language Primer - Version 5.10, release 2.0 - Berry (1998)   (Correct)

....explicit state enumeration technique by implicit traversal using BDDs in the Hurricane evolution of Tempest. Other Synchronous Languages Esterel is a member of a small community of synchronous languages born in the beginning of the 80 s. Cooperation has been constant with the Lustre team [30] headed by Paul Caspi and Nicolas Halbwachs in Grenoble, France, and the early Esterel and Lustre tools shared intermediate languages and compilation tools. Cooperation was later extended to the Signal [28] team headed by Paul le Guernic and Albert Benveniste in Rennes, France, The design of ....

....broadcasting was the way to handle communication in reactive systems, making it possible to handle together concurrency, determinism, and response time control, and yielding a programming style far more natural than the one enforced by conventional interactive communication mechanisms. Lustre [30], developed by Paul Caspi and Nicolas Halbwachs, is a synchronous functional data AEow language for data dominated systems. Signal [28] is a powerful relational synchronous data AEow language developed by Paul le Guernic and Albert Benveniste. Statecharts [32] is a visual formalism introduced by ....

N. Halbwachs, P. Caspi, and D. Pilaud. The synchronous dataAEow programming language Lustre. Another Look at Real Time Programming, Proceedings of the IEEE, Special Issue, Sept. 1991.


A Framework To Analyse Synchronous Data-Flow Specifications - Nebut, al. (2001)   (Correct)

..... 49 9.1.2 Analyses related to Lustre . 49 9.2 Perspectives . 50 1 Introduction Synchronous languages [26, 45, 28, 10] have been proposed to specify reactive systems, which interact continuously with the environment they are connected to. The imperative, state based and data AEow programming paradigms both involve the notion of logical instants and presence absence of signals. It is particularly apparent in ....

.... limited to its status, that is its presence or absence (valued signals also exist) Basic instructions specify that the system broadcasts signals (emit S) or reacts to the presence or absence of signals (e.g. present S then p else q) The equational data AEow languages like Signal [45] and Lustre [28] are better adapted to problems where data AEow is prevalent. Specications are systems of equations which describe the possible values carried by signals along the time. At a given instant, a signal (e.g. of type boolean, integer, etc) can be absent or present, hence carrying a signicant value. ....

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataAEow programming language lustre. Proceedings of the IEEE, 79(9):13051320, September 1991.


Fault-Tolerant Static Scheduling for Real-Time.. - Girault.. (2000)   (2 citations)  (Correct)

....SynDEx [29] tool implements AAA. The architecture and the algorithm graphs can be both drawn with SynDEx s graphical user interface. The latter graph can also be imported from a le which is the result of the compilation of a source program written in synchronous languages like Esterel [3] Lustre [20], or Signal [31] through the common format DC [47] In the following, we resume the main characteristics of the three models used in AAA: the algorithm model, the architecture model, and the implementation model. For a more detailed description, the reader should refer to [43, 48] 4.2 ....

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous data-AEow programming language Lustre. Proceedings of the IEEE, 79(9):13051320, September 1991.


A translation of Statecharts and Activitycharts.. - Beauvais.. (1998)   (2 citations)  (Correct)

....DC , syst#mes r#actifs temps r#els, langages synchrones, interop#rabilit#, g#n#ration de code A translation of Statecharts and Activitycharts into Signal equations 3 1 Introduction 1. 1 Context and objective Dioeerent languages exist for the design of reactive systems: the languages Lustre [8] and Signal [6] 3] are declarative and equational data AEow languages, while Esterel [5] Statecharts [9] and Argos [15] are imperative sequencing languages. The choice between the declarative and the imperative approach has an inAEuence upon facility to handle a given application area. For ....

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataAEow programming language Lustre. Proc. of the IEEE, 79(9):13051320, September 1991.


Hierarchic Normal Forms for Desynchronization - Talpin, Benveniste, Caillaud, .. (1999)   (Correct)

....are the following. First, Statecharts are a widely known and visual formalism [16] And, second, we wish to convince the reader that our technique for distributing synchronous programs extends beyond our own Signal formalism [20] and even beyond the ifrenchj synchronous Esterel [9] and Lustre [14, 15]. The Statecharts example shown in gure 1 will support our discussion throughout this paper. The Statecharts has four and states working in parallel : an arbiter, an emitter, and a out p 1 bit # 2 bit # h a a a a sleep sleep out : 4 out : 2 out : 4 resume reset p sp 1 p st 1 p ....

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataAEow programming language lustre. Proceedings of the IEEE, 79(9):13051320, September 1991.


An Implementation of Constructive Synchronous Programs in POLIS - Berry, Sentovich (1998)   (6 citations)  (Correct)

....models, with application to systems written in the Esterel synchronous programming language and implemented in the POLIS system developed at UC Berkeley and Cadence. The synchronous or zero delay model is used in circuit design and in synchronous programming languages such as Esterel [6] Lustre [12], Signal [10] and SyncCharts [2] a synchronous version of Statecharts [13] see [11] for a global overview. In this model, all bookkeeping actions such as control transmission and signal broadcasting are conceptually performed in zerotime, only explicit delays taking time. Thus, a conceptual ....

N. Halbwachs, P. Caspi, and D. Pilaud. The Synchronous DataAEow Programming Language Lustre. Another Look at Real Time Programming, Proceedings of the IEEE, Special Issue, September 1991.


The Steam Boiler Controller Problem in Signal-Coq - Kerboeuf, Nowak, Talpin (1999)   (Correct)

....disregarding execution and communication durations. It thus enables to specify, verify and simulate a reactive system at a functional level. The real time feature of the system will only be checked at the implementation stage on a particular architecture. Many programming languages like Lustre [12], Esterel [7, 9] or Statecharts [13] are based on this synchronous approach. Namely, Signal [6, 15] is a dataAEow language which handles in nite sequences of data: the signals. Veri cation The most common way to verify safety properties of reactive systems is model checking, which relies on ....

Halbwachs (N.), Caspi (P.), Raymond (P.) et Pilaud (D.). The synchronous dataAEow programming language lustre. Proceedings of the IEEE, vol. 79, n 9, september 1991, pp. 13051320.


The Foundations of Esterel - Berry (1998)   (90 citations)  (Correct)

....Lecture at Edinburgh University in 1996. 1.1 History The perfectly synchronous model and languages appeared independently in the beginning of the 80 s in dioeerent places. Esterel was de ned by the author in Sophia Antipolis [11, 10] Lustre was de ned by P. Caspi and N. Halbwachs in Grenoble [27]. Signal was developed by A. Benveniste and P. Le Guernic in Rennes [24] In Israel, D. Harel introduced the Statecharts quasi synchronous graphical formalism [30] In Grenoble, F. Maraninchi de ned the Argos formalism [38] that makes (restricted) Statecharts drawings fully synchronous. More ....

.... Gamma S t ) S t 1 = cos(S t U t 1 ) where U is the input signal, X is the output signal, with X 0 = 0, and S is an internal state variable, with S 0 = 1. In such a system, there is already an implicit perfect synchrony assumption: the time taken by the arithmetical operations is 0. In Lustre [26, 27], the system is rewritten as follows: node Control (U : float) returns (X : float) var S : float; let X = 0. U sin(pre(X) S pre(S) S = 1. cos(pre(S) U) tel or in an equivalent graphical form pictured in Figure 2. The time indices are removed, and a variable such as X denotes the ....

N. Halbwachs, P. Caspi, and D. Pilaud. The synchronous dataAEow programming language Lustre. Another Look at Real Time Programming, Proceedings of the IEEE, Special Issue, Sept. 1991.


Synchronous Modeling and Asynchronous Deployment of Mobile.. - Talpin (2000)   (Correct)

No context found.

N. Halbwachs, P. Caspi, P. Raymond, D. Pilaud. The synchronous data-AEow programming language Lustre. In Proceedings of the Ieee, v. 79(9). Ieee, 1991.

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