Abstraction and Empty Process in Process Algebra¹

Article type: Research Article

Authors: Baeten, J.C.M.^a | Van Glabbeek, R.J.^b

Affiliations: [a] Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands | [b] Dept. of Software Technology, Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands

Note: [1] Partial support received from the European Communities under ESPRIT contract no. 432, An Integrated Formal Approach to Industrial Software Development (Meteor).

Abstract: In this paper, we combine the hidden step η of the authors’ paper [2] with the empty process ε of VRANCKEN [12] and the authors’ [3]. We formulate a system ACPc, which is a conservative extension of the systems ACPη, ACP√, but also of ACPτ. This is a general system, in which most relevant issues can be discussed. Abstraction from internal steps can be achieved in two ways, in two stages: we can abstract to the hidden step η, and then from η to Milner’s silent step τ.

DOI: 10.3233/FI-1989-12208

Journal: Fundamenta Informaticae, vol. 12, no. 2, pp. 221-241, 1989