Issue No. 04 - April (1996 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.491649
<p><b>Abstract</b>—We present SL, a new programming language of the synchronous reactive family in which hypotheses about signal presence/absence are disallowed. One can decide that a signal is absent during an instant only at the end of this instant, and so reaction to this absence is delayed to the next instant. Sources of causal circularities are avoided, while only weak preemption remains. A structural operational semantics is provided through rewrite rules, and an implementation is described. In addition to directly executing programs, this implementation can also be used to produce automata by symbolic evaluation.</p>
Parallelism, concurrency, synchronous programming languages, automata, reactive systems.
R. de Simone and F. Boussinot, "The SL Synchronous Language," in IEEE Transactions on Software Engineering, vol. 22, no. , pp. 256-266, 1996.