Skip to main content
SpringerLink
Log in
Book cover

Prospects for Hardware Foundations pp 278–308Cite as

Grid Protocol Specifications

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

Abstract

A grid protocol models concurrent computation, and consists of one or more modules repeatedly performing parallel I/O and computation. We provide several concise specification formats and correctness results on (external) I/O behaviour, and illustrate our approach by examples

Keywords

  • Connected Network
  • Output Channel
  • Sequential Composition
  • Process Algebra
  • Early Read

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Partially sponsored by Esprit Working Group 8533 NADA — New Hardware Design Methods

This is a preview of subscription content, access via your institution.

eBook
USD   6.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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. J.C.M. Baeten and J.A. Bergstra. On sequential composition, action prefixes and process prefix. Formal Aspects of Computing, 6(3):83–98, 1994.

    CrossRef  Google Scholar 

  2. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Conditional axioms and α/β calculus in process algebra. In M. Wirsing, editor, Formal Description of Programming Concepts-III, Proceedings of the 3 rd IFIP WG 2.2 working conference, Ebberup 1986, pages 53–75, Amsterdam, 1987. North-Holland.

    Google Scholar 

  3. J.A. Bergstra, J.A. Hillebrand, and A. Ponse. Grid protocols based on synchronous communication, Science of Computer Programming, 29:199–233, 1997.

    CrossRef  MathSciNet  Google Scholar 

  4. E. van Buiten, M. de Jonge, and R. Monajemi. Beating Grid Protocols, PAII-thesis, University of Amsterdam, 1997.

    Google Scholar 

  5. M. Pouw. Beating Grid Protocols, Master’s Thesis, Utrecht University, 1997.

    Google Scholar 

  6. J.A. Bergstra and J.W. Klop. The algebra of recursively defined processes and the algebra of regular processes. In J. Paredaens, editor, Proceedings 11 th ICALP, Antwerpen, volume 172 of Lecture Notes in Computer Science, pages 82–95. Springer-Verlag, 1984. An extended version appeared in [PVV95], pages 1–25, 1995.

    Google Scholar 

  7. J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77–121, 1985.

    CrossRef  MATH  MathSciNet  Google Scholar 

  8. J.A. Bergstra and J.V. Tucker. Top down design and the algebra of communicating processes. Science of Computer Programming, 5(2):171–199, 1984.

    MathSciNet  Google Scholar 

  9. J.A. Bergstra and J.V. Tucker. Equational specifications, complete term rewriting systems, and computable and semicomputable algebras. Journal of the ACM, 42(6):1194–1230, 1995.

    CrossRef  MATH  MathSciNet  Google Scholar 

  10. J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

    Google Scholar 

  11. G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. General Techniques and Regular Problems, volume 1 of Solving Problems on Concurrent Processors. Prentice-Hall International, 1988.

    Google Scholar 

  12. W.J. Fokkink, Axiomatizations for the perpetual loop in process algebra. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. 24th Colloquium on Automata, Languages and Programming-ICALP’97, pages 571–581. Lecture Notes in Computer Science Vol. 1256, Springer-Verlag, Berlin, 1997.

    Google Scholar 

  13. J.F. Groote and H. Korver. A correctness proof of the bakery protocol in μCRL. In [PVV95], pages 63–86, 1995.

    Google Scholar 

  14. J.F. Groote and A. Ponse. Proof theory for μCRL. (Extended version.) Report CS-R9138, CWI, Amsterdam, 1991.

    Google Scholar 

  15. J.F. Groote and A. Ponse. Proof theory for μCRL: a language for processes with data. In D.J. Andrews, J.F. Groote, and C.A. Middelburg, editors, Proceedings of the International Workshop on Semantics of Specification Languages, pages 232–251. Workshops in Computing, Springer-Verlag, 1994.

    Google Scholar 

  16. J.F. Groote and A. Ponse. The syntax and semantics of μCRL. In [PVV95], pages 26–62, 1995.

    Google Scholar 

  17. J.A. Hillebrand. A simple language for the specification of grid protocols (working title). Technical Report, Programming Research Group, University of Amsterdam, tto appear.

    Google Scholar 

  18. S.C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pages 3–41. Princeton University Press, 1956.

    Google Scholar 

  19. R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.

    MATH  Google Scholar 

  20. A. Ponse, C. Verhoef, and S.F.M. vanVlijmen, editors. Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing. Springer-Verlag, 1995.

    Google Scholar 

  21. G.D. Smith. Numerical Solution of Partial Differential Equations, Oxford University Press, 1965.

    Google Scholar 

  22. B.C. Thompson and J.V. Tucker. Equational specification of Synchronous Concurrent Algorithms and architectures (Second Edition). Report CSR 15–94, University of Wales, Swansea, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, University of Amsterdam, Kruislaan 403, NL-1098, SJ Amsterdam, The Netherlands

    Jan A. Bergstra & Alban Ponse

  2. Department of Philosophy, Utrecht University, P.O. Box 80126, NL-3508, TC Utrecht, The Netherlands

    Jan A. Bergstra

Authors
  1. Jan A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alban Ponse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Augsburg, Universitätsstr. 14, D-86135, Augsburg, Germany

    Bernhard Möller

  2. Department of Computer Science, University of Wales at Swansea, Singleton Park, Swansea, SA2 8PP, Wales, UK

    John V. Tucker

Rights and permissions

Reprints and Permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bergstra, J.A., Ponse, A. (1998). Grid Protocol Specifications. In: Möller, B., Tucker, J.V. (eds) Prospects for Hardware Foundations. Lecture Notes in Computer Science, vol 1546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49254-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-49254-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49254-2

  • eBook Packages: Springer Book Archive

Search

Navigation