Skip to main content
SpringerLink
Log in

Synchronous Structures

  • Conference paper
  • First Online:
CONCUR’99 Concurrency Theory (CONCUR 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1664))

Included in the following conference series:

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. 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Samson Abramsky. Interaction Categories (Extended Abstract). In G. L. Burn, Simon J. Gay, and M. D. Ryan, editors, Theory and Formal Methods 1993: Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods, pages 57–70. Springer-Verlag Workshops in Computer Science, 1993.

    Google Scholar 

  2. Albert Benveniste, Paul Le Guernic, and Christian Jacquemot. Synchronous programming with events and relations: the Signal language and its semantics. Science of Computer Programming, 16:103–149, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  3. Albert Benveniste, Paul Le Guernic, and Pascal Aubry. Compositionality in dataflow synchronous languages: specification & code generation. Research Report 3310, INRIA, 1997.

    Google Scholar 

  4. Gérard Berry and Georges Gonthier. The esterel synchronous programming language: design, semantics, implementation. Science of Computer Programming, 19:87–152, 1992.

    Article  MATH  Google Scholar 

  5. Gerolamo Cardano. Ars Magna. 1545.

    Google Scholar 

  6. P. Caspi. Clocks in dataflow languages. Theoretical Computer Science, 94(1):125–140, March 1992.

    Article  MATH  MathSciNet  Google Scholar 

  7. Bruno Barras et al. The Coq Proof Assistant Reference Manual-Version 6.2. INRIA, Rocquencourt, May 1998.

    Google Scholar 

  8. Simon J. Gay and Raja Nagarajan. Modelling Signal in Interaction Categories. In Geoffrey L. Burn, Simon J. Gay, and Mark D. Ryan, editors, Theory and Formal Methods 1993: Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods. Springer-Verlag Workshops in Computer Science, 1993.

    Google Scholar 

  9. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language Lustre. Proc. of the IEEE, 79(9):1305–1320, September 1991.

    Article  Google Scholar 

  10. Nicolas Halbwachs. Synchronous Programming of Reactive Systems. Kluwer Academic Pub., 1993.

    Google Scholar 

  11. D. Nowak, J. P. Talpin, and T. Gautier. Un système de modules avancé pour Signal. Technical Report 3176, Irisa / Inria-Rennes, 1997.

    Google Scholar 

  12. David Nowak, Jean-René Beauvais, and Jean-Pierre Talpin. Coinductive Axiomatization of a Synchronous Language. In Proceedings of Theorem Proving in Higher Order Logics (TPHOLs’98), number 1479 in LNCS, pages 387–399. Springer Verlag, September 1998.

    Chapter  Google Scholar 

  13. Amir Pnueli, Natarajan Shankar, and Eli Singerman. Fair Synchronous Transition Systems and their Liveness Proofs. Technical Report SRI-CSL-98-02, The Weizmann Institute of Science and SRI International, 1998.

    Google Scholar 

  14. J.-P. Talpin, A. Benveniste, B. Caillaud, C. Jard, Z. Bouziane, and H. Canon. Bdl, a language of distributed reactive objects. In Proceedings of the International Symposium on Object-Oriented Real-Time Distributed Computing. IEEE press, april 1998.

    Google Scholar 

  15. G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II; Proceedings of an Advanced Course, Bad Honnef, September 1986, volume 255 of Lecture Notes in Computer Science, pages 325–392. Springer-Verlag, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inria-Rennes — Irisa, Campus de Beaulieu, F-35042, Rennes Cédex

    David Nowak, Jean-Pierre Talpin & Paul Le Guernic

Authors
  1. David Nowak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Pierre Talpin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul Le Guernic
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nowak, D., Talpin, JP., Le Guernic, P. (1999). Synchronous Structures. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66425-3

  • Online ISBN: 978-3-540-48320-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation