G. Berry. The semantics of pure Esterel. In M. Broy, editor, Program Design Calculi, volume 118 of Series F: Computer and System Sciences, pages 361-409. NATO ASI Series, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....explicitly requested to do so. The reaction is also required to be deterministic: for any state of the program and any input event, there is exactly one possible output event. In perfectly synchronous languages, a reaction is also called an instant. 1 For a detailed treatment, please refer to [30, 96, 36, 26, 20] 110 A.1 Statements Esterel has two kinds of statements: the primitive or kernel statements, and the derived statements that can be expanded into primitive ones by macro expansion and make the language more user friendly. Derived statements are not semantically meaningful and will not be ....

G. Berry. The semantics of pure Esterel. In M. Broy, editor, Program Design Calculi, volume 118 of Series F: Computer and System Sciences, pages 361--409. NATO ASI Series, 1993.

....are clearly separated. 5.1.2 Notions and programming style To understand the Esterel design of the production cell, some basic constructs are explained. Readers interested in a more complete overview should read [1] those ESTEREL 75 interested in the semantics of the language should read [2]. All constructs are introduced using examples from the production cell. Simple statements of Esterel are: emit for emitting signals. halt for freezing further computation of a reaction in this instant. Compound statements of Esterel: present to test for presence or absence of signals. ....

G. Berry. The semantics of pure Esterel. in Proc. Marktoberndorf Intl. Summer School on Program Design Calculi, LNCS, Springer Verlag, 1993 92 Reinhard Budde

....a semantical instance of the synchronous paradigm. With respect to Synchronous Automata, Boolean Automata constitute their essential kernel in which pure synchronous programs may be compiled. For instance, a process representable as a Boolean Automaton may be a program specified in pure Esterel [7] or the clock component of a Signal program [20] The presentation of Boolean Automata is split into two steps. First, in subsection 4.1, we introduce the component of Boolean Automata for modelling the reactions to stimuli that are specified by synchronous programs. Then, in subsection 4.2, we ....

G. Berry. The semantics of pure Esterel. In M. Broy, editor, Program Design Calculi, volume 118 of Serie F: Computer and System Sciences. NATO ASI, 1993.

....system The connect operation depends on the exact ordering of the input events, which implies the existence of some kind of synchronization control mechanism. In this context, conventional computer programming techniques are not suitable. A solution is to adopt the perfect synchrony hypothesis [2], which states that time is defined externally to programs by the flow of inputs, and that program internal bookkeeping is done in zerodelay with respect to all external time units [3] This hypothesis shows the problem of inter process communication. To solve it, all synchronous languages ....

G. Berry. The semantics of pure Esterel. In M. Broy, editor, Program Design Calculi, volume 118 of Series F: Computer and System Sciences, pages 361--409. NATO ASI Series, 1993.

....6, 8] in the logic programming and deductive database communities. Since our reactive rule based programs contain negation, we are able to apply some results from the above areas in a new context. Other reactive and real time programming languages, such as Statecharts [10, 11, 12, 19] and Esterel [4, 2, 3] have to tackle similar semantical problems. The causality paradox in synchronous languages [9] is a well known problem leading to ill defined programs. This corresponds to our programs being rule inconsistent or ambiguous. Esterel has a similar approach as ours, and attempts to reject ....

....problems. The causality paradox in synchronous languages [9] is a well known problem leading to ill defined programs. This corresponds to our programs being rule inconsistent or ambiguous. Esterel has a similar approach as ours, and attempts to reject ill defined programs at compile time [2, 3]. The next version of Esterel compiler is expected to adopt a constructive semantics [3] That constructive semantics is also used in cyclic circuit analysis [15, 21] somewhat resembling analysis of RL programs. In case of Statecharts [19] global consistency is considered, which corresponds to ....

G. Berry. The semantics of pure Esterel. In M. Broy, editor, Program Design Calculi, volume 118 of F: Computer and System Sciences, pages 361--409. NATO ASI Series, 1993.

....signal happens before instruction 1 ends. This instruction terminates when instruction 1 does, or when instruction 2 does if a timeout occurs. In general, more user friendly statements are derived from a set of primitive or kernel statements. A detailed description of its semantics is presented in [2]. The complete list of kernel statements is: nothing halt emit signal instruction 1 ; instruction 2 loop instruction end present signal then instruction 1 else instruction 2 end do instruction watching signal instruction 1 instruction 2 trap trap in instruction ....

Berry, G.: The Semantics of Pure Esterel. In Program Design Calculi, Broy, M. (ed.), Nato Asi Series, Computer and System Sciences 118 (1993) 361--409

....(deterministic) process is defined as follows: fff(s 1 AE( s 2 AE1) 2) 3g; p 2 ; 3g; p 1 g 7 Conclusion We have presented the Esterel zero delay calculus and its must preemption operators. The reader interested in knowing more about the semantical properties of the language should refer to [5, 8]. Comparable must preemption mechanisms exist in other calculi or languages. The closest ones are in Reactive C [12] and Electre [26] The Statecharts graphical formalism is based on weak preemption and it contains an enter by history mechanism that has 3 Triggers are written await s do p ....

G. Berry. The semantics of pure esterel. In Proc Marktoberdorf Intl. Summer School on Program Design Calculi, LNCS, to appear. Springer-Verlag, 1993.

No context found.

G. Berry. The semantics of pure Esterel. In M. Broy, editor, Program Design Calculi, volume 118 of Series F: Computer and System Sciences, pages 361-409. NATO ASI Series, 1993.

No context found.

G. Berry. The semantics of pure esterel. In Proc Marktoberdorf Intl. Summer School on Program Design Calculi, LNCS, to appear. Springer-Verlag, 1993.

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