Abstract
In this paper, we study the issue of process creation from an algebraic perspective. The key to our approach, which is inspired by work of America and De Bakker, consists of giving a new interpretation to the operator symbol · (sequential composition) in the axiom system BPA of Bergstra and Klop. We present a number of other models for BPA and show how the new interpretation of · naturally generalises the usual interpretation in ACP. We give an operational semantics based on Plotkin style inductive rules for a simple language with process creation and communication, and give a complete finite axiomatisation of the associated bisimulation model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[A] America, P.: Definition of the programming language Pool-T, ESPRIT project 415, Nr. 0091, Philips Research Laboratories, Eindhoven 1985
[AB] America, P., Bakker, J.W. de: Designing equivalent semantic models for process creation. Theoret Comput. Sci.60, 109–176 (1988)
[ANSI] ANSI: Reference manual for the Ada programming language. ANSI/MIL-STD 1815 A, United States Department of Defense, Washington, Dc 1983
[AuB] Austry, D., Boudol, G.: Algèbre de processus et synchronisation. Theoret. Comput. Sci.30, 91–131 (1984)
[BB] Baeten, J.C.M., Bergstra, J.A.: Global renaming operators in concrete process algebra. Inf. Comput.78, 205–245 (1988)
[BBK] Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Conditional axioms and α/β-calculus in process algebra. In: Proc. IFIP Conf. Formal Descr. of Progr. Concepts III (M. Wirsing ed.), pp. 53–75. Amsterdam: North-Holland 1987
[BG] Baeten, J.C.M., Glabbeek, R.J. van: Merge and termination in process algebra. In: Proc. 7th FST & TCS, Pune (K.V. Nori, ed.), (Lect. Notes Comput. Sci., vol. 287, pp. 153–172) Berlin-Heidelberg-New York: Springer 1987
[B] Bergstra, J.A.: A process creation mechanism in process algebra. In: J.C.M. Baeten (ed.) Applications of process algebra (Camb. Tracts Theoret. Comput. Sci., vol. 17, pp. 81–88) Cambridge: Cambridge University Press 1990
[BHK] Bergstra, J.A., Heering, J., Klint, P.: Module algebra. J. Assoc. Comput. Mach.37, 335–372 (1990)
[BK1] Bergstra, J.A., Klop, J.W.: Fixed point semantics in process algebras. Report IW 206, Math. Centre, Amsterdam 1982
[BK2] Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf. Comput.60, 109–137 (1984)
[BK3] Bergstra, J.A., Klop, J.W.: Process algebra: specification and verification in bisimulation semantics. In: M. Hazewinkel, J.K. Lenstra, L.G.L.T. Meertens (eds.) Mathematics and Computer Science II (CWI Monograph 4, pp. 61–94). Amsterdam: North-Holland 1986
[BIM] Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can't be traced: preliminary report. In: Proc. 15th POPL, San Diego, CA, 1988, pp. 229–239
[Br] Brinksma, E.: On the design of extended LOTOS. Ph.D. thesis, University of Twente, 1988
[CDP] Castellano, L., Michelis, G., de, Pomello, L.: Concurrency vs. interleaving: an instructive example. Bulletin EATCS31, 12–15 (1987)
[DDM] Degano, P., Nicola, R., de, Montanari, U.: A distributed operational semantics for CCS based on condition event systems. Acta Inf.26, 59–91 (1988)
[vG] Glabbeek, R.J. van: Bounded nondeterminism and the approximation induction principle in process algebra. In: F.J. Brandenburg, G. Vidal-Naquet, M. Wirsing (eds.) Proc. STACS 87 (Lect. Notes Comput. Sci., vol. 247, pp. 336–347) Berlin-Heidelberg-New York: Springer 1987
[GG] Glabbeek, R.J. van, Goltz, U.: Refinement of actions in causality based models. In: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (eds.) Proc. REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, Mook 1989 (Lect. Notes Comput Sci., vol. 430, pp. 267–300) Berlin-Heidelberg-New York: Springer 1990
[vGV] Glabbeek, R.J. van, Vaandrager, F.W.: Modular specifications in process algebra (with curious queues). In: M. Wirsing, J.A. Bergstra (eds.) Algebraic methods: Theory, tools and applications (Lect. Notes Comput. Sci., vol. 394, pp. 465–506). Berlin-Heidelberg-New York: Springer 1989
[Gr] Groote, J.F.: Transition system specifications with negative premises. In: J.C.M. Baeten, J.W. Klop, (eds.) Proc. CONCUR '90, Amsterdam (Lect. Notes Comput. Sci., vol. 458, pp. 332–341) Berlin-Heidelberg-New York: Springer 1990
[GV] Groote, J.F., Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Report CS-R8845, Centre for Math. Comput. Sci., Amsterdam 1988. To appear in Inf. Comput. Extended abstract. In: G. Ausiello, M. Dezani-Ciancaglini, S. Ronchi Della Rocca (eds.) Proc. 16th ICALP, Stresa (Lect. Notes Comput. Sci., Vol. 372, pp. 423–438) Berlin-Heidelberg-New York: Springer, 1989
[H] Hoare, C.A.R.: Communicating sequential processes. Englewood Cliffs, NJ: Prentice-Hall 1985
[KW] Kossen, L., Weijland, W.P.: Correctness proofs for systolic algorithms: palindromes and sorting. In: J.C.M. Baeten (ed.) Applications of process algebra (Cambridge Tract in Theor. Comput. Sci., vol. 17, pp. 89–125). Cambridge: Cambridge University Press 1990
[KV] Koymans, C.J.P., Vrancken, J.L.M.: Extending, process algebra with the empty process ε. Report LGPS 1. Faculty of Philosophy, State university of Utrecht 1985
[K] Kung, K.T.: Let's design algorithms for VLSI systems. In: Proc. Conf. on VLSI: architecture, design, fabrication, California Institute of Technology, 1979
[MdS] Madelaine, E., Simone, R. de: Ecrins un laboratoire de preuve pour les calculs de processus. Report R.R. 672. INRIA, Sophia Antipolis 1987
[M1] Milner, R.: A calculus for communicating systems. (Lect. Notes Comput. Sci., vol. 92) Berlin-Heidelberg-New York: Springer 1980
[M2] Milner, R.: Communication and concurrency. Englewood Cliffs, N.J.: Prentice-Hall International 1989
[O] Olderog, E.-R.: Operational Petri net semantics for CCSP. In: G. Rozenberg (ed.) Advances in Petri nets. (Lect. Notes Comput. Sci., vol. 266, pp. 196–223) Berlin-Heidelberg-New York: Springer 1987
[Pa] Park, D.M.R.: Concurrency and automata on infinite sequences. In: P. Deussen (ed.) Proc. 5th GI Conference (Lect. Notes Comput. Sci., vol. 104, pp. 167–183) Berlin-Heidelberg-New York: Springer 1981
[P1] Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI FN-19, Comp. Sci. Dept., Aarhus University 1981
[dS] Simone, R. de: Higher-level synchronising devices in Meije-SCCS. Theor. Comput. Sci.37, 245–267 (1985)
[SS] Smolka, S.A., Strom, R.E.: A CCS semantics for NIL. In: M. Wirsing (ed.) Formal description of programming concepts III, pp. 347–367. Amsterdam: North-Holland 1987
[UNIX] UNIX: Programmer's reference manual, 4.3 BSD edition. Computer Systems Research Group, UC Berkeley 1986
[Va] Vaandrager, F.W.: Process algebra semantics of POOL. In: J.C.M. Baeten (ed.) Applications of process algebra (Cambridge Tract in Theor. Comput. Sci., vol. 17, pp. 173–236). Cambridge: Cambridge University Press 1990
[W] Winskel, G.: Event structures. In: W. Brauer, W. Reisig, G. Rozenberg (eds.) Petri Nets: Applications and Relationship to Other Models of Concurrency, Bad Honnef 1986 (Lect. Notes Comput. Sci., vol. 255, pp. 325–392) Berlin-Heidelberg-New York: Springer 1987
Author information
Authors and Affiliations
Additional information
Note: Partial support received from the European Communities under ESPRIT contract 432, An Integrated Formal Approach to Industrial Software Development (METEOR), and RACE contract 1046, Specification and Programming Environment for Communication Software (SPECS).
Rights and permissions
About this article
Cite this article
Baeten, J.C.M., Vaandrager, F.W. An algebra for process creation. Acta Informatica 29, 303–334 (1992). https://doi.org/10.1007/BF01178776
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01178776