Synchronous structures

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. We define an order-theoretical model that gives a unified mathematical formalization of all the above aspects of the synchronous methodology (from relations to circuits). The model has been specified and validated using a theorem prover as part of the certified, reference compiler of a synchronous programming language.

[1]  Samson Abramsky,et al.  Interaction Categories , 1993, Theory and Formal Methods.

[2]  Natarajan Shankar,et al.  Fair Synchronous Transition Systems and Their Liveness Proofs , 1998, FTRTFT.

[3]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[4]  Jean-Pierre Talpin,et al.  Co-inductive Axiomatization of a Synchronous Language , 1998, TPHOLs.

[5]  Albert Benveniste,et al.  Compositionality in Dataflow Synchronous Languages: Specification and Distributed Code Generation , 2000, Inf. Comput..

[6]  Albert Benveniste,et al.  programmi language and its , 2001 .

[7]  Rajagopal Nagarajan,et al.  Specification Structures and Propositions-as-Types for Concurrency , 1996, Banff Higher Order Workshop.

[8]  P. Guernic.  Compositionality in Dataaow Synchronous Languages : Speciication & Code Generation Compositionality in Dataaow Synchronous Languages : Speciication & Code Generation , 2007 .

[9]  David Nowak.  Spécification et preuve de systèmes réactifs , 1999 .

[10]  Paul Caspi.  Clocks in Dataflow Languages , 1992, Theor. Comput. Sci..

[11]  Albert Benveniste,et al.  Compositionality in Dataflow Synchronous Languages: Specification and Code Generation , 1997, COMPOS.

[12]  Benoît Caillaud,et al.  BDL, a language of distributed reactive objects , 1998, Proceedings First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98).

[13]  Irina Madalina Smarandache.  Transformations affines d'horloges : application au codesign de systemes temps-reel en utilisant les langages signal et alpha , 1998 .

[14]  Pascal Raymond,et al.  The synchronous data flow programming language LUSTRE , 1991, Proc. IEEE.

[15]  Samson Abramsky.  Interaction categories (extended abstract) , 1994, FME 1994.

[16]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[17]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[18]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[19]  Christine Paulin-Mohring,et al.  The coq proof assistant reference manual , 2000 .

[20]  Nicolas Halbwachs,et al.  Synchronous Programming of Reactive Systems , 1992, CAV.

[21]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..

[22]  Jean-Pierre Talpin,et al.  A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems , 1998, FSTTCS.

[23]  Rajagopal Nagarajan,et al.  Modelling SIGNAL in Interaction Categories , 1993, Theory and Formal Methods.