Advertisement

An Experiment in Implementing Process Algebra Specifications in a Procedural Language

  • C. Groza
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

This paper presents a method for the implementation of process algebra specifications in a (structured) imperative language. The original specification is written in the Process Specification Formalism (PSF). The actual implementation is made in an extension of the C language for concurrent programming. First we make an informal presentation and then we consider a formal approach.

Keywords

Finite Automaton Sequential Composition Parallel Composition Atomic Action Concurrent Programming 
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 and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.CrossRefGoogle Scholar
  2. [2]
    J.A. Bergstra, J. Heering, and P. Klint. The algebraic specification formalism ASF. In J.A. Bergstra, J. Heering, and P. Klint, editors, Algebraic Specification, ACM Press Frontier Series, pages 1–66. The ACM Press in co-operation with Addison-Wesley, 1989. Chapter 1.Google Scholar
  3. [3]
    C. Groza. An experiment in implementing process algebra specifications in an imperative language. Report P9412, University of Amsterdam, 1994.Google Scholar
  4. [4]
    J. Heering, P.R.H. Hendriks, P. Klint, and J. Rekers. The syntax definition formalism SDF - reference manual. SIGPLAN Notices, 24(ll):43–75, 1989.CrossRefGoogle Scholar
  5. [5]
    J. Heering and P. Klint. The syntax definition formalism SDF. In J.A. Bergstra, J. Heering, and P. Klint, editors, Algebraic Specification, ACM Press Frontier Series, pages 283–297. The ACM Press in co-operation with Addison-Wesley, 1989. Chapter 6.Google Scholar
  6. [6]
    P. Klint. A meta-environment for generating programming environments. ACM Transactions on Software Engineering Methodology, 2(2):176–201, 1993.CrossRefGoogle Scholar
  7. [7]
    D.E. Knuth. Literate programming. The Computer Journal, 27(2):97–111, 1984.MATHCrossRefGoogle Scholar
  8. [8]
    S. Mauw and G.J. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.MATHGoogle Scholar
  9. [9]
    A.S. Tanenbaum. Computer networks. Prentice-Hall International, Englewood Cliffs, 1989.Google Scholar
  10. [10]
    J.L.M. Vrancken. The implementation of process algebra specifications in POOL-T. Report P8807, Programming Research Group, University of Amsterdam, 1988.Google Scholar

Copyright information

© British Computer Society 1995

Authors and Affiliations

  • C. Groza
    • 1
  1. 1.Department of Computer ScienceTechnical University of TimişoaraTimişoaraRomânia

Personalised recommendations