An Experiment in Implementing Process Algebra Specifications in a Procedural Language
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.
KeywordsFinite Automaton Sequential Composition Parallel Composition Atomic Action Concurrent Programming
Unable to display preview. Download preview PDF.
- 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
- C. Groza. An experiment in implementing process algebra specifications in an imperative language. Report P9412, University of Amsterdam, 1994.Google Scholar
- 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
- A.S. Tanenbaum. Computer networks. Prentice-Hall International, Englewood Cliffs, 1989.Google Scholar
- J.L.M. Vrancken. The implementation of process algebra specifications in POOL-T. Report P8807, Programming Research Group, University of Amsterdam, 1988.Google Scholar