The SL synchronous language

Author

Boussinot, Frédéric ; De Simone, Robert

Author_Institution

CMA, Ecole des Mines de Paris, Valbonne, France

Volume

22

Issue

4

fYear

1996

fDate

4/1/1996 12:00:00 AM

Firstpage

256

Lastpage

266

Abstract

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

Keywords

computational linguistics; grammars; parallel languages; parallel programming; program compilers; rewriting systems; specification languages; SL synchronous language; automata; direct program execution; programming language; rewrite rules; signal absence; signal presence; structural operational semantics; symbolic evaluation; synchronous reactive languages; weak preemption; Automata; Computer languages; Concurrent computing; Delay; Equations; Program processors; Protocols; Radio control; Resumes; TV broadcasting;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.491649

Filename

491649