No label defined (Q3813288)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4082959
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4082959

      Statements

      0 references
      0 references
      0 references
      1988
      0 references
      synchronous programming
      0 references
      Reactive systems
      0 references
      synchronous languages
      0 references
      synchrony
      0 references
      semantics
      0 references
      0 references
      0 references
      [For the entire collection see Zbl 0639.00038.] Reactive systems (introduced by Harel und Pnueli) are systems that repeatedly respond to inputs from the environment by producing outputs. Since none of the existing tools for programming/analysing such systems (communicating automata, Petri nets, parallel programming languages, algebraic calculi of processes) are likely to lead to both good programming style and execution efficiency, the authors present the new class of synchronous languages. The authors deal with some new programming concepts: synchrony, signal broadcasting, the use of multiple time units. The exposition is based on the authors' synchronous language ESTEREL (overviews of other such languages are also given). The common formalism shared by all these languages is that of a program acting as a synchronous history transformer. The synchrony hypothesis (stating that the response to input is instantaneous), though being an idealization of the real finitely fast machines, fits all the cases where the reaction time does not cause input overrun. The ESTEREL primitives, their naive semantics and some examples are given. The notion of causal correctness - which is analogous to the deadlock-freeness in asynchronous programs (but is statically checkable) - is introduced. Using the mathematical semantics of ESTEREL (which is given by a set of rewrite rules à la Plotkin) and a variant of Brzozowski's algorithm, it is shown how an ESTEREL program can be transformed into an automaton. The quality of the compiled code is discussed.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references