## Synchronous Structures (1999)

### Cached

### Download Links

- [ftp.comlab.ox.ac.uk]
- [ftp.comlab.ox.ac.uk]
- [www.irisa.fr]
- DBLP

### Other Repositories/Bibliography

Citations: | 11 - 7 self |

### BibTeX

@MISC{Nowak99synchronousstructures,

author = {David Nowak},

title = {Synchronous Structures},

year = {1999}

}

### OpenURL

### Abstract

Synchronous languages have been designed to ease the development of reactive systems, by providing a methodological framework for assisting system designers from the early stages of requirement specifications to the final stages of code generation or circuit production. Synchronous languages enable a very high-level specification and an extremely modular design of complex reactive systems by structural decomposition of them into elementary processes. We define an order-theoretical model that gives a unified mathematical formalisation of all the above aspects of the synchronous methodology and characterises the essentials of the synchronous paradigm.

### Citations

3400 | Communicating Sequential Processes - Hoare - 1985 |

671 | The esterel synchronous programming language : design, semantics, implementation. Rapport de recherche RR-842
- Berry, Gonthier
- 1988
(Show Context)
Citation Context ...d validated using a theorem prover as part of the certified, reference compiler of a synchronous programming language. 1 Introduction Synchronous languages, such as Signal [2], Lustre [9] and Esterel =-=[4]-=- have been designed to ease the development of reactive systems. The synchronous hypothesis provides a deterministic notion of concurrency where operations and communications are instantaneous. In a s... |

488 | The synchronous dataflow programming language lustre
- Halbwachs, Caspi, et al.
- 1991
(Show Context)
Citation Context ...een specified and validated using a theorem prover as part of the certified, reference compiler of a synchronous programming language. 1 Introduction Synchronous languages, such as Signal [2], Lustre =-=[9]-=- and Esterel [4] have been designed to ease the development of reactive systems. The synchronous hypothesis provides a deterministic notion of concurrency where operations and communications are insta... |

405 | Synchronous Programming of Reactive Systems
- Halbwachs
- 1993
(Show Context)
Citation Context ...ith three real solutions, he was forced to take at a certain stage the square root of a negative number. The imaginary numbers were borned. Analogically, we generalize the classical notion of signal (=-=[2, 3, 10]-=-) with imaginary signals. This extension has no material counterpart. It is used to compute intermediate results. For instance, the temporal abstractions of signals (called clocks) have necessary a gr... |

263 |
Event structures
- Winskel
- 1986
(Show Context)
Citation Context ...amma! Y 0 ; f\Omega g = def : X\Omega X 0 \Gamma! Y\Omega Y 0 = hf ffi [X] X\Omega X 0 ; g ffi [X 0 ] X\Omega X 0 i conjecture that the category Sig can be related to the category of event strutures (=-=[15]-=-) through functors. (Y ) Z)\Omega Y Apply Y;Z Z X\Omega Y (f)\Omega [Y ] Y OO f ;; v v v v v v v v v v v v v v v v v v v v 4 Data Dependence In this section, we complete our notion of partial ordered ... |

139 | The ESTEREL Synchronous Programming Language - Berry, Gonthier - 1992 |

108 |
Synchronous programming with events and relations: the signal language and its semantics
- Benveniste, Guernic, et al.
- 1991
(Show Context)
Citation Context ... model has been specified and validated using a theorem prover as part of the certified, reference compiler of a synchronous programming language. 1 Introduction Synchronous languages, such as Signal =-=[2]-=-, Lustre [9] and Esterel [4] have been designed to ease the development of reactive systems. The synchronous hypothesis provides a deterministic notion of concurrency where operations and communicatio... |

61 | Compositionality in dataflow synchronous languages: Specification and distributed code generation
- Benveniste, Caillaud, et al.
- 2000
(Show Context)
Citation Context ...ith three real solutions, he was forced to take at a certain stage the square root of a negative number. The imaginary numbers were borned. Analogically, we generalize the classical notion of signal (=-=[2, 3, 10]-=-) with imaginary signals. This extension has no material counterpart. It is used to compute intermediate results. For instance, the temporal abstractions of signals (called clocks) have necessary a gr... |

30 |
Clocks in Dataflow languages
- Caspi
- 1992
(Show Context)
Citation Context ...lings and communications. This pre-order theoretic model is put into practice in the design of Bdl ([14]), a synchronous specification language that uses families of pre-orders to specify systems. In =-=[6]-=-, the problem of characterizing synchrony without using a special symbol for absence is addressed in terms of multiple onput-output sequential machines. In [8], the language Signal has been modelled i... |

21 |
The synchronous data ¯ow programming language LUSTRE
- Halbwachs, Caspi, et al.
(Show Context)
Citation Context ...s been speci ed and validated using a theorem prover as part of the certi ed, reference compiler of a synchronous programming language. 1 Introduction Synchronous languages, such asSignal [2], Lustre =-=[9]-=- and Esterel [4] have been designed to ease the development of reactive systems. The synchronous hypothesis provides a deterministic notion of concurrency where operations and communications are insta... |

21 | Specification structures and propositions-as-types for concurrency - Abramsky, Gay, et al. - 1995 |

20 |
Interaction categories (extended abstract
- Abramsky
- 1993
(Show Context)
Citation Context ...izing synchrony without using a special symbol for absence is addressed in terms of multiple onput-output sequential machines. In [8], the language Signal has been modelled in interaction categories (=-=[1]-=-) where processes are morphisms and objects are types of processes. 7 Conclusion We have defined a unified model which formalizes all aspects of the development of a reactive system using the underlyi... |

14 | Category theory for the working mathematician - Lane |

9 | Co-inductive axiomatization of a synchronous language
- Nowak, Beauvais, et al.
- 1998
(Show Context)
Citation Context .... It has been specified and validated using the Coq proof assistant [7]. This implementation is part of a certified, reference compiler of the Signal language. It completes and extends the results of =-=[12]-=- on the definition of a co-inductive trace semantics of Signal in Coq. Influential Analogy. In 1545, the great Italian mathematician Gerolamo Cardano wrote an important and influential treatise on Alg... |

8 | BDL, a language of distributed reactive objects
- Talpin, Benveniste, et al.
- 1998
(Show Context)
Citation Context ...ony). In [3], STS is extended with preorders and partial orders to model causality relations, schedulings and communications. This pre-order theoretic model is put into practice in the design of Bdl (=-=[14]-=-), a synchronous specification language that uses families of pre-orders to specify systems. In [6], the problem of characterizing synchrony without using a special symbol for absence is addressed in ... |

6 |
et al. The Coq Proof Assistant Reference
- Barras
- 1998
(Show Context)
Citation Context ... a synchronous methodology and which contains each of them in isolation. The model uses basic notions of set-theory and order-theory. It has been specified and validated using the Coq proof assistant =-=[7]-=-. This implementation is part of a certified, reference compiler of the Signal language. It completes and extends the results of [12] on the definition of a co-inductive trace semantics of Signal in C... |

6 | Fair Synchronous Transition Systems and their
- Pnueli, Shankar, et al.
- 1998
(Show Context)
Citation Context ...gh to deal with more theoretical aspect of synchronous programming such as dependencies. The semantics of a synchronous language can be described in a better way with Symbolic Transition System (STS) =-=[13]-=-. This is a formalism on which fundamental questions can be investigated. But it manipulates the absence of a signal as a special value. This is not consistent with reality: the absence of a signal ha... |

6 | Synchronous Programming with Events and Relations - Benveniste, Guernic, et al. - 1991 |

5 | A synchronous semantics of higher-order processes for modeling reconfigurable reactive systems - Talpin, Nowak - 1998 |

4 |
Clocks in dataow languages
- Caspi
- 1992
(Show Context)
Citation Context ...dulings and communications. This pre-order theoretic model is put into practice in the design of Bdl ([14]), a synchronous specication language that uses families of pre-orders to specify systems. In =-=[6]-=-, the problem of characterizing synchrony without using a special symbol for absence is addressed in terms of multiple onput-output sequential machines. In [8], the language Signal has been modelled i... |

4 | Benoît Caillaud, and Paul Le Guernic. Compositionality in dataflow synchronous languages: Specification & distributed code generation - Benveniste - 2000 |

3 | Modelling SIGNAL in interaction categories
- Gay, Nagarajan
- 1993
(Show Context)
Citation Context ...ies of pre-orders to specify systems. In [6], the problem of characterizing synchrony without using a special symbol for absence is addressed in terms of multiple onput-output sequential machines. In =-=[8]-=-, the language Signal has been modelled in interaction categories ([1]) where processes are morphisms and objects are types of processes. 7 Conclusion We have defined a unified model which formalizes ... |

2 |
Un systeme de modules avance pour Signal. Rapport de recherche n
- Nowak, Talpin, et al.
- 1997
(Show Context)
Citation Context ...) j j zn := n$ init 0 j j n := (capacity when f ill) default (zn \Gamma 1) j j empty := when (n = 0) default (not f ill) j j) = n; zn This program uses an extended and more intuitive syntax of Signals=-=[11]-=- that can be translated into the Signal-kernel described in this overview. synchro is a process that forces its input signals to be synchronous. The following table illustrates an execution of the pro... |

2 |
Compositionality in dataow synchronous languages: specication and distributed code generation
- Benveniste, Caillaud, et al.
- 2000
(Show Context)
Citation Context ...ith three real solutions, he was forced to take at a certain stage the square root of a negative number. The imaginary numbers were borned. Analogically, we generalize the classical notion of signal (=-=[2, 3, 10]-=-) with imaginary signals. This extension has no material counterpart. It is used to compute intermediate results. For instance, the temporal abstractions of signals (called clocks) have necessary a gr... |

2 | editors. Theory and Formal Methods 1993 - Burn, Gay, et al. - 1993 |

1 | and Rajagopal Nagarajan. Modelling Signal in Interaction Categories - Gay |

1 | Chapter 3 of Sp ecification et preuve de syst emes r eactifs - Nowak |

1 | Chapter 6 of Transformations affines d'horloges: application au codesign de syst emes temps-r eel en utilisant les langages Signal et Alpha - Smarandache - 1998 |

1 | it Caillaud, Claude Jard, Zakaria Bouziane, and Hubert Canon. Bdl, a Language of Distributed Reactive Objects - Talpin, Benveniste, et al. - 1998 |