Skip to main content

Introducing Mutual Exclusion in Esterel

  • Conference paper
  • First Online:
  • 250 Accesses

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

Abstract

We show how the synchronous programming language Esterel can be extended by a new statement to implement mutual exclusive code sections. We also show how the thereby extended Esterel language can be translated back to standard Esterel and we prove the correctness of this transformation. Additionally, we show that the translation fits well into different verification approaches.

This work has been financed by the DFG priority program ‘Design and Design Methodology of Embedded Systems’.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Berry and G. Gonthier. The Esterel synchronous programming language: Design, semantics, implementation. Science of Computer Programming, 19(2):87–152, 1992.

    Article  MATH  Google Scholar 

  2. G. Berry. The constructive semantics of pure Esterel, May 1996.

    Google Scholar 

  3. G. Berry. The foundations of Esterel. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1998.

    Google Scholar 

  4. E. W. Dijkstra. Solution of a problem in concurrent programming control. Comm. ACM, 8(9):569, 1965.

    Article  Google Scholar 

  5. E. W. Dijkstra. Cooperating sequential processes. In F. Genuys, editor, Programming Languages, Academic Press, New York, p.43–112, 1968.

    Google Scholar 

  6. L. Lamport. A new solution of Dijkstra’s concurrent programming problem. Comm. ACM, 17(8):453–455, 1974.

    Article  MATH  MathSciNet  Google Scholar 

  7. G. L. Peterson. A new solution to Lamport’s concurrent programming problem. ACM Transactions on Progr. Lang. and Systems, 5(1):56–65, 1983.

    Article  MATH  Google Scholar 

  8. H. Touati and G. Berry. Optimized controller synthesis using Esterel. In International Workshop on Logic Synthesis, Lake Tahoe, 1993. IEEE Computer Society Press.

    Google Scholar 

  9. H. Toma, E. Sentovitch, and G. Berry. Latch optimization in circuits generated from high-level descriptions. In IEEE/ACM International Conference on Computer Aided Design (ICCAD). ACM/IEEE, IEEE Computer Society Press, 1996.

    Google Scholar 

  10. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.

    MATH  Google Scholar 

  11. E.A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 996–1072, Amsterdam, 1990. Elsevier Science Publishers.

    Google Scholar 

  12. K. Schneider. CTL and equivalent sublanguages of CTL*. In C. Delgado Kloos, editor, IFIP Conference on Computer Hardware Description Languages and their Applications (CHDL), pages 40–59, Toledo, Spain, April 1997. IFIP, Chapman and Hall.

    Google Scholar 

  13. K. Schneider. Model checking on product structures. In G.C. Gopalakrishnan and P.J. Windley, editors, Formal Methods in Computer-Aided Design, vol.1522 of Lecture Notes in Computer Scienc, pages 483–500, Palo Alto, CA, November 1998. Springer Verlag.

    Google Scholar 

  14. M.J.C. Gordon and T.F. Melham. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.

    Google Scholar 

  15. K. Schneider and T. Kropf. The C@S system: Combining proof strategies for system verification. In T. Kropf, editor, Formal Hardware Verification-Methods and Systems in Comparison, volume 1287 of Lecture Notes in Computer Science, pages 248–329. Springer Verlag, state of the art report edition, August 1997.

    Google Scholar 

  16. K.M. Chandry and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schneider, K., Sabelfeld, V. (2000). Introducing Mutual Exclusion in Esterel. In: Bjøner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 1999. Lecture Notes in Computer Science, vol 1755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46562-6_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-46562-6_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67102-2

  • Online ISBN: 978-3-540-46562-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics