Grid protocols based on synchronous communication

Science of Computer Programming

Volumn 29, Issue 1-2, 1997, Pages 199-233

  Bergstra, Jan A ^a,b   Hillebrand, Joris A ^a   Ponse, Alban ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Grid protocol; Parallel computation; Parallel input and output; Stream transformers; Synchronous networks

Indexed keywords

INPUT OUTPUT PROGRAMS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; THEOREM PROVING;

GRID PROTOCOLS; ONE DIMENSIONAL WAVE EQUATION; PARALLEL INPUTS AND OUTPUTS; SYNCHRONOUS COMMUNICATION; SYNCHRONOUS NETWORKS;

NETWORK PROTOCOLS;

EID: 0031185512     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6423(96)00035-4     Document Type: Article

References (24)

1. J.C.M. Baeten and J.A. Bergstra, On sequential composition, action prefixes and process prefix, J. Formal Aspects Comput. Sci. 6 (3) (1994) 83-98.
2. J.C.M. Baeten, J.A. Bergstra and J.W. Klop, Conditional axioms and α/β calculus in process algebra, in: M. Wirsing, ed., Formal Description of Programming Concepts - III, Proc. 3rd IFIP WG 2.2 Working Conf., Ebberup, 1986 (North-Holland, Amsterdam, 1987) 53-75.
3. J.C.M. Baeten and W.P. Weijland. Process Algebra, Cambridge Tracts in Theoretical Computer Science, Vol. 18 (Cambridge Univ. Press, Cambridge, 1990).
4. J.A. Bergstra, I. Bethke and A. Ponse, Process algebra with iteration and nesting, Comput. J. 37 (4) (1994) 243-258.
5. J.A. Bergstra and J.W. Klop, The algebra of recursively defined processes and the algebra of regular processes, in: J. Paredaens, ed., Proc. 11th ICALP, Antwerpen. Lecture Notes in Computer Science, Vol. 172 (Springer, Berlin, 1984) 82-95; an extended version appeared in: A. Ponse, C. Verhoef and S.F.M. van Vlijmen, eds., Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing (Springer, Berlin, 1995) 1-25.
6. J.A. Bergstra and J.W. Klop, The algebra of recursively defined processes and the algebra of regular processes, in: J. Paredaens, ed., Proc. 11th ICALP, Antwerpen. Lecture Notes in Computer Science, Vol. 172 (Springer, Berlin, 1984) 82-95; an extended version appeared in: A. Ponse, C. Verhoef and S.F.M. van Vlijmen, eds., Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing (Springer, Berlin, 1995) 1-25.
7. J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction, Theoret. Comput. Sci. 37 (1) (1985) 77-121.
8. J.A. Bergstra, C.A. Middelburg and Gh. Ştefǎnescu, Network algebra for synchronous and asynchronous dataflow, Tech. Report P9508, Programming Research Group, University of Amsterdam, 1995.
9. J.A. Bergstra and J.V. Tucker, Top-down design and the algebra of communicating processes, Sci. Comput. Programming 5 (2) (1985) 171-199.
10. J.A. Bergstra and J.V. Tucker, Equational specifications, complete term rewriting systems, and computable and semicomputable algebras, J. ACM 42 (6) (1995) 1194-1230.
11. W.J. Fokkink and H. Zantema, Basic process algebra with iteration: completeness of its equational axioms, Comput. J. 37 (4) (1994) 259-267.
12. G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon and D. Walker, General Techniques and Regular Problems, Solving Problems on Concurrent Processors, Vol. 1 (Prentice-Hall, Englewood Cliffs, NJ, 1988).
13. J.F. Groote and H. Korver, A correctness proof of the bakery protocol in μCRL, in: A. Ponse, C. Verhoef and S.F.M. van Vlijmen, eds., Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing (Springer, Berlin, 1995) 63-86.
14. J.F. Groote and A. Ponse, Proof theory for μCRL (extended version), Report CS-R9138, CWI, Amsterdam, 1991.
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, eds., Proc. Internat. Workshop on Semantics of Specification Languages, Workshops in Computing (Springer, Berlin, 1994) 232-251.
16. J.F. Groote and A. Ponse, The syntax and semantics of μCRL, in: A. Ponse, C. Verhoef and S.F.M. van Vlijmen, eds., Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing (Springer, Berlin, 1995) 26-62.
17. J.A. Hillebrand, A small language for the specification of grid protocols, Technical Report p9608, Programming Research Group, University of Amsterdam, 1996. Also appeared in: Experiments in specification re-engineering, PhD. thesis, University of Amsterdam, 1996.
18. S.C. Kleene, Representation of events in nerve nets and finite automata, in: Automata Studies (Princeton Univ. Press, Princeton, NJ, 1956) 3-41.
19. S. Mauw and G.J. Veltink, A process specification formalism, Fund. Inform. XIII (1990) 85-139.
20. S. Mauw and G.J. Veltink eds., Algebraic Specification of Communication Protocols, Cambridge Tracts in Theoretical Computer Science, Vol. 36 (Cambridge Univ. Press, Cambridge, 1993).
21. R. Milner, Communication and Concurrency (Prentice-Hall, Englewood Cliffs, NJ, 1989).
22. G.D. Smith, Numerical Solution of Partial Differential Equations (Oxford University Press, Oxford, 1965).
23. B.C. Thompson and J.V. Tucker, Equational specification of synchronous concurrent algorithms and architectures (2nd ed.), Report CSR 15-94, University of Wales, Swansea, 1994.
24. G.J. Veltink, The PSF toolkit, Comput. Networks ISDN Systems 25 (1993) 875-898.