Advertisement

An algebraic specification of process algebra, including two examples

Part IV An Algebraic Approach To Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 394)

Abstract

A study is made of the possibilities to describe process algebra as an algebraic specification. Two examples from the field of the specification of communication protocols are discussed to analyse the adequacy of this approach in practical situations.

Keywords

Specification Language Process Algebra Implicit Definition Sort Data Algebraic Specification 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.C.M. Baeten, Procesalgebra, [in Dutch], Kluwer, 1986.Google Scholar
  2. [2]
    J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Conditional axioms and α/β calculus in process algebra, Proc. IFIP Conf. on Formal Description of Programming Concepts — III, Ebberup 1986, (M. Wirsing, ed.), North-Holland Amsterdam, pp.53–75, 1987.Google Scholar
  3. [3]
    J.C.M. Baeten, J.A. Bergstra & J.W. Klop, On the consistency of Koomen's Fair Abstraction Rule, Report CS-R8504, Centre for Math. and Comp. Sci., Amsterdam 1985, to appear in TCS 51 (1/2), 1987.Google Scholar
  4. [4]
    J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inf. IX (2), pp. 127–168, 1986.Google Scholar
  5. [5]
    J.A. Bergstra, Put and get, primitives for synchronous unreliable message passing, CIF report LGPS 3, State University of Utrecht, 1985.Google Scholar
  6. [6]
    J.A. Bergstra, J. Heering & P. Klint, Algebraic definition of a simple programming language, Report CS-R8504, Centre for Math. and Comp. Sci., Amsterdam 1985.Google Scholar
  7. [7]
    J.A. Bergstra, J. Heering & P. Klint, ASF — An algebraic specification formalism, report CS-R8705, Centre for Math. and Comp. Sci., Amsterdam 1987.Google Scholar
  8. [8]
    J.A. Bergstra & J.W. Klop, Algebra of communicating processes, Proc. CWI Symp. Math. & Comp. Sci. (J.W. de Bakker, M. Hazewinkel & J.K. Lenstra, eds.), pp. 89–138, North-Holland, 1986.Google Scholar
  9. [9]
    J.A. Bergstra & J.W. Klop, Algebra of communicating processes with abstraction, TCS 37 (1), pp. 77–121, 1985.CrossRefGoogle Scholar
  10. [10]
    J.A. Bergstra & J.W. Klop, Conditional Rewrite Rules: Confluence and Termination, JCSS 32, pp. 323–362, 1986.Google Scholar
  11. [11]
    J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60 (1/3), pp. 109–137, 1984.Google Scholar
  12. [12]
    E. Brinksma (ed.), LOTOS, A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, ISO DIS 8807, 1987.Google Scholar
  13. [13]
    H. Ehrig, W. Fey & H. Hansen, ACT ONE, an algebraic specification language with two levels of semantics, TU Berlin, FB 20, Techn. Report 83-03, 1983.Google Scholar
  14. [14]
    H. Ehrig & B. Mahr, Fundamentals of Algebraic Specification 1, Springer verlag, 1985.Google Scholar
  15. [15]
    L.M.G. Feijs, H.B.M. Jonkers, C.P.J. Koymans & G.R. Renardel de Lavalette, Formal definition of the design language COLD-K, Technical Report, ESPRIT project 432, Doc.Nr. METEOR/t7/PRLE/7, 1987.Google Scholar
  16. [16]
    J.V. Guttag & J.J. Horning, The algebraic specification of abstract datatypes, Acta Informatica 10, pp. 27–52, 1978.CrossRefGoogle Scholar
  17. [17]
    C.A.R. Hoare, Communicating sequential processes, Prentice Hall International, 1985.Google Scholar
  18. [18]
    H.B.M. Jonkers, A concrete syntax for COLD-K, Philips Research Laboratories Eindhoven, 1988.Google Scholar
  19. [19]
    R. Milner, A calculus of communicating systems, Springer LNCS 92, 1980.Google Scholar
  20. [20]
    W. Reisig, Petrinetze, Springer-Verlag, 1982.Google Scholar
  21. [21]
    A.S. Tanenbaum, Computer Networks, Prentice Hall, 1981.Google Scholar
  22. [22]
    F.W. Vaandrager, Verification of two communication protocols by means of process algebra, Report CS-R8608, Centre for Math. and Comp. Sci., Amsterdam 1986.Google Scholar
  23. [23]
    H.R. Walters, An annotated algebraic specification of the static semantics of POOL, FVI report 86-20, University of Amsterdam, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • S. Mauw
    • 1
  1. 1.Programming Research GroupUniversity of AmsterdamAmsterdamThe Netherlands

Personalised recommendations