{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:50Z","timestamp":1761611150044},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1007\/bf01178776","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T16:50:34Z","timestamp":1108659034000},"page":"303-334","source":"Crossref","is-referenced-by-count":17,"title":["An algebra for process creation"],"prefix":"10.1007","volume":"29","author":[{"given":"Jos C. M.","family":"Baeten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits W.","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","series-title":"ESPRIT project 415, Nr. 0091","volume-title":"Definition of the programming language Pool-T","author":"P. America","year":"1985","unstructured":"[A] America, P.: Definition of the programming language Pool-T, ESPRIT project 415, Nr. 0091, Philips Research Laboratories, Eindhoven 1985"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(88)90048-5","volume":"60","author":"P. America","year":"1988","unstructured":"[AB] America, P., Bakker, J.W. de: Designing equivalent semantic models for process creation. Theoret Comput. Sci.60, 109?176 (1988)","journal-title":"Theoret Comput. Sci."},{"key":"CR3","series-title":"ANSI\/MIL-STD 1815 A","volume-title":"Reference manual for the Ada programming language","author":"ANSI","year":"1983","unstructured":"[ANSI] ANSI: Reference manual for the Ada programming language. ANSI\/MIL-STD 1815 A, United States Department of Defense, Washington, Dc 1983"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(84)90067-7","volume":"30","author":"D. Austry","year":"1984","unstructured":"[AuB] Austry, D., Boudol, G.: Alg\u00e8bre de processus et synchronisation. Theoret. Comput. Sci.30, 91?131 (1984)","journal-title":"Theoret. Comput. Sci."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","volume":"78","author":"J.C.M. Baeten","year":"1988","unstructured":"[BB] Baeten, J.C.M., Bergstra, J.A.: Global renaming operators in concrete process algebra. Inf. Comput.78, 205?245 (1988)","journal-title":"Inf. Comput."},{"key":"CR6","first-page":"53","volume-title":"Proc. IFIP Conf. Formal Descr. of Progr. Concepts III","author":"J.C.M. Baeten","year":"1987","unstructured":"[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"},{"key":"CR7","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-18625-5_49","volume-title":"Proc. 7th FST & TCS, Pune","author":"J.C.M. Baeten","year":"1987","unstructured":"[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"},{"key":"CR8","series-title":"Camb. Tracts Theoret. Comput. Sci.","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1017\/CBO9780511608841.006","volume-title":"Applications of process algebra","author":"J.A. Bergstra","year":"1990","unstructured":"[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"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/77600.77621","volume":"37","author":"J.A. Bergstra","year":"1990","unstructured":"[BHK] Bergstra, J.A., Heering, J., Klint, P.: Module algebra. J. Assoc. Comput. Mach.37, 335?372 (1990)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR10","series-title":"Report IW","volume-title":"Fixed point semantics in process algebras","author":"J.A. Bergstra","year":"1982","unstructured":"[BK1] Bergstra, J.A., Klop, J.W.: Fixed point semantics in process algebras. Report IW 206, Math. Centre, Amsterdam 1982"},{"key":"CR11","first-page":"109","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"[BK2] Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf. Comput.60, 109?137 (1984)","journal-title":"Inf. Comput."},{"key":"CR12","series-title":"CWI Monograph","first-page":"61","volume-title":"Mathematics and Computer Science II","author":"J.A. Bergstra","year":"1986","unstructured":"[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"},{"key":"CR13","unstructured":"[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"},{"key":"CR14","unstructured":"[Br] Brinksma, E.: On the design of extended LOTOS. Ph.D. thesis, University of Twente, 1988"},{"key":"CR15","first-page":"12","volume":"31","author":"L. Castellano","year":"1987","unstructured":"[CDP] Castellano, L., Michelis, G., de, Pomello, L.: Concurrency vs. interleaving: an instructive example. Bulletin EATCS31, 12?15 (1987)","journal-title":"Bulletin EATCS"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02915446","volume":"26","author":"P. Degano","year":"1988","unstructured":"[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)","journal-title":"Acta Inf."},{"key":"CR17","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/BFb0039617","volume-title":"Proc. STACS 87","author":"R.J. Glabbeek van","year":"1987","unstructured":"[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"},{"key":"CR18","series-title":"Lect. Notes Comput Sci.","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-52559-9_68","volume-title":"Proc. REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, Mook 1989","author":"R.J. Glabbeek van","year":"1990","unstructured":"[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"},{"key":"CR19","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BFb0015049","volume-title":"Algebraic methods: Theory, tools and applications","author":"R.J. Glabbeek van","year":"1989","unstructured":"[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"},{"key":"CR20","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/BFb0039069","volume-title":"Proc. CONCUR '90, Amsterdam","author":"J.F. Groote","year":"1990","unstructured":"[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"},{"key":"CR21","series-title":"Report CS-R8845","first-page":"423","volume-title":"Structured operational semantics and bisimulation as a congruence","author":"J.F. Groote","year":"1988","unstructured":"[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"},{"key":"CR22","volume-title":"Communicating sequential processes","author":"C.A.R. Hoare","year":"1985","unstructured":"[H] Hoare, C.A.R.: Communicating sequential processes. Englewood Cliffs, NJ: Prentice-Hall 1985"},{"key":"CR23","series-title":"Cambridge Tract in Theor. Comput. Sci.","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1017\/CBO9780511608841.007","volume-title":"Applications of process algebra","author":"L. Kossen","year":"1990","unstructured":"[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"},{"key":"CR24","unstructured":"[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"},{"key":"CR25","unstructured":"[K] Kung, K.T.: Let's design algorithms for VLSI systems. In: Proc. Conf. on VLSI: architecture, design, fabrication, California Institute of Technology, 1979"},{"key":"CR26","series-title":"Report R.R. 672","volume-title":"Ecrins un laboratoire de preuve pour les calculs de processus","author":"E. Madelaine","year":"1987","unstructured":"[MdS] Madelaine, E., Simone, R. de: Ecrins un laboratoire de preuve pour les calculs de processus. Report R.R. 672. INRIA, Sophia Antipolis 1987"},{"key":"CR27","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A calculus for communicating systems","author":"R. Milner","year":"1980","unstructured":"[M1] Milner, R.: A calculus for communicating systems. (Lect. Notes Comput. Sci., vol. 92) Berlin-Heidelberg-New York: Springer 1980"},{"key":"CR28","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"[M2] Milner, R.: Communication and concurrency. Englewood Cliffs, N.J.: Prentice-Hall International 1989"},{"key":"CR29","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-18086-9_27","volume-title":"Advances in Petri nets","author":"E.-R. Olderog","year":"1987","unstructured":"[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"},{"key":"CR30","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proc. 5th GI Conference","author":"D.M.R. Park","year":"1981","unstructured":"[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"},{"key":"CR31","unstructured":"[P1] Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI FN-19, Comp. Sci. Dept., Aarhus University 1981"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"[dS] Simone, R. de: Higher-level synchronising devices in Meije-SCCS. Theor. Comput. Sci.37, 245?267 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"CR33","first-page":"347","volume-title":"Formal description of programming concepts III","author":"S.A. Smolka","year":"1987","unstructured":"[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"},{"key":"CR34","unstructured":"[UNIX] UNIX: Programmer's reference manual, 4.3 BSD edition. Computer Systems Research Group, UC Berkeley 1986"},{"key":"CR35","series-title":"Cambridge Tract in Theor. Comput. Sci.","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1017\/CBO9780511608841.010","volume-title":"Applications of process algebra","author":"F.W. Vaandrager","year":"1990","unstructured":"[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"},{"key":"CR36","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationship to Other Models of Concurrency, Bad Honnef 1986","author":"G. Winskel","year":"1987","unstructured":"[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"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178776.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01178776\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:07:56Z","timestamp":1556629676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01178776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF01178776"],"URL":"https:\/\/doi.org\/10.1007\/bf01178776","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}