{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:53:17Z","timestamp":1761918797384},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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":[[1986,4]]},"DOI":"10.1007\/bf00268075","type":"journal-article","created":{"date-parts":[[2006,2,19]],"date-time":"2006-02-19T05:14:38Z","timestamp":1140326078000},"page":"9-66","source":"Crossref","is-referenced-by-count":194,"title":["Specification-oriented semantics for Communicating Processes"],"prefix":"10.1007","volume":"23","author":[{"given":"E. -R.","family":"Olderog","sequence":"first","affiliation":[]},{"given":"C. A. R.","family":"Hoare","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00268075_CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2","author":"K.R. Apt","year":"1980","unstructured":"Apt, K.R., Francez, N., de Roever, W.P.: A proof system for communicating sequential processes. ACM TOPLAS 2, 359\u2013385 (1980)","journal-title":"ACM TOPLAS"},{"key":"BF00268075_CR2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/322358.322372","volume":"30","author":"K.R. Apt","year":"1983","unstructured":"Apt, K.R.: Formal justification of a proof system for communicating sequential processes. J. Assoc. Comput. Mach. 30, 197\u2013216 (1983)","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00268075_CR3","volume-title":"Mathematical theory of program correctness","author":"J.W. Bakker de","year":"1980","unstructured":"de Bakker, J.W.: Mathematical theory of program correctness. London: Prentice Hall 1980"},{"key":"BF00268075_CR4","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0304-3975(84)90114-2","volume":"34","author":"J.W. Bakker de","year":"1984","unstructured":"de Bakker, J.W., Bergstra, J.A., Klop, J.W., Meyer, J.-J.C.: Linear time and branching time semantics for recursion with merge. TCS 34, 134\u2013156 (1984)","journal-title":"TCS"},{"key":"BF00268075_CR5","unstructured":"de Bakker, J.W., Meyer, J.-J.C., Olderog, E.-R.: Infinite streams and finite observations in the semantics of uniform concurrency. In: Proc. 12th Coll. Automata, Languages and Programming. (W. Brauer ed.). Lect. Notes Comput. Sci. 194, 149\u2013157 (1985)"},{"key":"BF00268075_CR6","doi-asserted-by":"crossref","unstructured":"de Bakker, J.W., Meyer, J.-J.C., Olderog, E.-R., Zucker, J.I.: Transition systems, infinitary languages and the semantics of uniform concurrency. In: Proc. 17th ACM Symposium on Theory of Computing, pp. 252\u2013262. Providence 1985","DOI":"10.1145\/22145.22174"},{"key":"BF00268075_CR7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","volume":"54","author":"J.W. Bakker de","year":"1982","unstructured":"de Bakker, J.W., Zucker, J.I.: Processes and the denotational semantics of concurrency. Inf. Control 54, 70\u2013120 (1982)","journal-title":"Inf. Control"},{"key":"BF00268075_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. TCS 37, 77\u2013121 (1985)","journal-title":"TCS"},{"key":"BF00268075_CR9","series-title":"Report CS-R8523","volume-title":"Readies and failures in the algebra of communicating processes","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W., Olderog, E.-R.: Readies and failures in the algebra of communicating processes. Report CS-R8523, Center for Mathematics and Computer Science, Amsterdam 1985"},{"key":"BF00268075_CR10","doi-asserted-by":"crossref","unstructured":"Brock, J.D., Ackermann, W.B.: Scenarios: a model for nondeterminate computations. In: Formalisation of Programming Concepts (J. Diaz, I. Ramos, eds.). Lect. Notes Comput. Sci. 107, 252\u2013267 (1981)","DOI":"10.1007\/3-540-10699-5_102"},{"key":"BF00268075_CR11","unstructured":"Brookes, S.D.: A model for communicating sequential processes. D. Phil. Thesis, Oxford Univ. 1983"},{"key":"BF00268075_CR12","doi-asserted-by":"crossref","unstructured":"Brookes, S.D.: On the relationship of CCS and CSP. In: Proc. 10th Coll. Automata, Languages and Programming (J. Diaz, ed.). Lect. Notes Comput. Sci. 154, 83\u201396 (1983)","DOI":"10.1007\/BFb0036899"},{"key":"BF00268075_CR13","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. Assoc. Comput. Mach. 31, 560\u2013599 (1984)","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00268075_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-15670-4_14","volume":"197","author":"S.D. Brookes","year":"1985","unstructured":"Brookes, S.D., Roscoe, A.W.: An improved failures model for communicating sequential processes. In: Proc. NSF-SERC Seminar on Concurrency. Lect. Notes Comput. Sci. 197, 281\u2013305 (1985)","journal-title":"Proc. NSF-SERC Seminar on Concurrency. Lect. Notes Comput. Sci."},{"key":"BF00268075_CR15","first-page":"125","volume-title":"Formal Description of Programming Concepts II","author":"M. Broy","year":"1983","unstructured":"Broy, M.: Fixed point theory for communication and concurrency. In: Formal Description of Programming Concepts II (D. Bj\u00f8rner, ed.), pp. 125\u2013146. Amsterdam: North Holland 1983"},{"key":"BF00268075_CR16","unstructured":"Chaochen, Z., Hoare, C.A.R.: Partial correctness of communicating processes. In: Proc. 2nd International Conference on Distributed Computing Systems. Paris 1981"},{"key":"BF00268075_CR17","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(79)90006-0","volume":"19","author":"N. Francez","year":"1979","unstructured":"Francez, N., Hoare, C.A.R., Lehmann, D.J., de Roever, W.P.: Semantics of nondeterminism, concurrency and communication. J. Comput. Syst. Sci. 19, 290\u2013308 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"BF00268075_CR18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(84)90022-7","volume":"32","author":"N. Francez","year":"1984","unstructured":"Francez, N., Lehmann, D., Pnueli, A.: A linear history semantics for languages for distributed programming. TCS 32, 25\u201346 (1984)","journal-title":"TCS"},{"key":"BF00268075_CR19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J.A. Goguen","year":"1977","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Initial algebra semantics and continuous algebras. J. Assoc. Comput. Mach. 24, 68\u201395 (1977)","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00268075_CR20","doi-asserted-by":"crossref","unstructured":"Guessarian, I.: Algebraic semantics. Lect. Notes Comput. Sci. 99 (1981)","DOI":"10.1007\/3-540-10284-1"},{"key":"BF00268075_CR21","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/69610.357988","volume":"27","author":"E.C.R. Hehner","year":"1984","unstructured":"Hehner, E.C.R.: Predicative programming, Part I and II. Commun. ACM 27, 134\u2013151 (1984)","journal-title":"Commun. ACM"},{"key":"BF00268075_CR22","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(83)90081-6","volume":"26","author":"E.C.R. Hehner","year":"1983","unstructured":"Hehner, E.C.R., Hoare, C.A.R.: A more complete model of communicating processes. TCS 26, 105\u2013120 (1983)","journal-title":"TCS"},{"key":"BF00268075_CR23","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M.: Acceptance trees. J. Assoc. Comput. Mach. 32, 896\u2013928 (1985)","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00268075_CR24","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach. 32, 137\u2013161 (1985)","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00268075_CR25","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21, 666\u2013677 (1978)","journal-title":"Commun. ACM"},{"key":"BF00268075_CR26","first-page":"229","volume-title":"On the Construction of Programs","author":"C.A.R. Hoare","year":"1980","unstructured":"Hoare, C.A.R.: A model for communicating sequential processes. In: On the Construction of Programs (R.M. McKeag, A.M. McNaghton, eds.), pp. 229\u2013243. Cambridge: University Press 1980"},{"key":"BF00268075_CR27","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6423(81)90005-8","volume":"1","author":"C.A.R. Hoare","year":"1981","unstructured":"Hoare, C.A.R.: A calculus of total correctness for communicating processes. Sci. Comput. Program. 1, 49\u201372 (1981)","journal-title":"Sci. Comput. Program."},{"key":"BF00268075_CR28","unstructured":"Hoare, C.A.R.: Specifications, programs and implementations. Tech. Monograph PRG-29, Progr. Research Group. Oxford University 1982"},{"key":"BF00268075_CR29","volume-title":"Communicating sequential processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating sequential processes. London: Prentice Hall 1985"},{"key":"BF00268075_CR30","volume-title":"OCCAM programming manual","author":"INMOS","year":"1984","unstructured":"INMOS: OCCAM programming manual. London: Prentice Hall 1984"},{"key":"BF00268075_CR31","unstructured":"Jorrand, P.: Specification of communicating processes and process implementation correctness. In: Proc. 5th Intern. Symp. on Programming. (M. Dezani-Ciancaglini, U. Montanari, eds.). Lect. Notes Comput. Sci. 137, 242\u2013256 (1983)"},{"key":"BF00268075_CR32","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R. Keller","year":"1976","unstructured":"Keller, R.: Formal verification of parallel programs. Commun. ACM 19, 371\u2013384 (1976)","journal-title":"Commun. ACM"},{"key":"BF00268075_CR33","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF00289266","volume":"15","author":"G.M. Levin","year":"1981","unstructured":"Levin, G.M., Gries, D.: A proof technique for communicating sequential processes. Acta Inf. 15, 281\u2013302 (1981)","journal-title":"Acta Inf."},{"key":"BF00268075_CR34","doi-asserted-by":"crossref","unstructured":"Milner, R.: A calculus of communicating systems. Lect. Notes Comput. Sci. 92 (1980)","DOI":"10.1007\/3-540-10235-3"},{"key":"BF00268075_CR35","doi-asserted-by":"crossref","unstructured":"Milner, R.: A modal characterisation of observable machine-behaviour. In: Proc. 6th Coll. Trees in Algebra and Programming (E. Asteriano, C. B\u00f6hm, eds.). Lect. Notes Comput. Sci. 112, 25\u201334 (1981)","DOI":"10.1007\/3-540-10828-9_52"},{"key":"BF00268075_CR36","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. TCS 25, 267\u2013310 (1983)","journal-title":"TCS"},{"key":"BF00268075_CR37","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"Misra, J., Chandy, K.M.: Proofs of networks of processes. IEEE Trans. Software Eng. 7, 417\u2013426 (1981)","journal-title":"IEEE Trans. Software Eng."},{"key":"BF00268075_CR38","doi-asserted-by":"crossref","unstructured":"Misra, J., Chandy, K.M., Smith, T.: Proving safety and liveness of communicating processes with examples. In: Proc. 1st ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing, pp. 201\u2013208. Ottawa 1982","DOI":"10.1145\/800220.806698"},{"key":"BF00268075_CR39","doi-asserted-by":"crossref","unstructured":"de Nicola, R.: A complete set of axioms for a theory of communicating sequential processes. In: Proc. Intern. Conf. on Foundations of Computation Theory (M. Karpinski, ed.). Lect. Notes Comput. Sci. 158, 115\u2013126 (1983)","DOI":"10.1007\/3-540-12689-9_98"},{"key":"BF00268075_CR40","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"de Nicola, R., Hennessy, M.: Testing equivalences for processes. TCS 34, 83\u2013134 (1984)","journal-title":"TCS"},{"key":"BF00268075_CR41","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/978-3-642-82453-1_14","volume-title":"Logics and Models of Concurrent Systems","author":"E.-R. Olderog","year":"1985","unstructured":"Olderog, E.-R.: Specification-oriented programming in TCSP. In: Logics and Models of Concurrent Systems (K.R. Apt, ed.), pp. 397\u2013435. Berlin, Heidelberg, New York: Springer 1985"},{"key":"BF00268075_CR42","unstructured":"Olderog, E.-R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes (preliminary version). In: Proc. 10th Coll. Automata, Languages and Programming (J. Diaz, ed.). Lect. Notes Comput. Sci. 154, 561\u2013572 (1983)"},{"key":"BF00268075_CR43","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S. Owicki","year":"1982","unstructured":"Owicki, S., Lamport, L.: Proving liveness properties of concurrent programs. ACM TOPLAS 4, 455\u2013495 (1982)","journal-title":"ACM TOPLAS"},{"key":"BF00268075_CR44","first-page":"199","volume-title":"Formal Description of Programming Concepts II","author":"G.D. Plotkin","year":"1983","unstructured":"Plotkin, G.D.: An operational semantics for CSP. In: Formal Description of Programming Concepts II (D. Bj\u00f8rner, ed.), pp. 199\u2013223. Amsterdam: North Holland 1983"},{"key":"BF00268075_CR45","unstructured":"Reinecke, R.: Networks of communicating processes: a functional implementation. Manuscript, Dept. Comput. Sci., Univ. of Kaiserslautern 1983"},{"key":"BF00268075_CR46","unstructured":"Roscoe, A.W.: A mathematical theory of communicating processes. D. Phil., Thesis, Oxford Univ. 1982"},{"key":"BF00268075_CR47","doi-asserted-by":"crossref","unstructured":"Rounds, W.C., Brookes, S.D.: Possible futures, acceptances, refusals and communicating processes. In: Proc. 22nd IEEE Symp. on Foundations of Computer Science, Nashville, Tennessee 1981","DOI":"10.1109\/SFCS.1981.36"},{"key":"BF00268075_CR48","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M.B. Smyth","year":"1978","unstructured":"Smyth, M.B.: Power domains. J. Comput. Syst. Sci. 16, 23\u201326 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"BF00268075_CR49","unstructured":"Soundararajan, N., Dahl, O.-J.: Partial correctness semantics of communicating sequential processes. Research Rep. No. 66, Inst. of Informatics, Univ. of Oslo 1982"},{"key":"BF00268075_CR50","volume-title":"Denotational semantics: the Scott-Strachey approach to programming language theory","author":"J.E. Stoy","year":"1977","unstructured":"Stoy, J.E.: Denotational semantics: the Scott-Strachey approach to programming language theory. Cambridge: MIT Press 1977"},{"key":"BF00268075_CR51","unstructured":"Winskel, G.: Events in computation. Ph. D. Thesis, Dept. Comput. Sci., Univ. of Edinburgh 1980"},{"key":"BF00268075_CR52","doi-asserted-by":"crossref","unstructured":"Zwiers, J., de Roever, W.P., van Emde Boas, P.: Compositionality and concurrent networks. In: Proc. 12th Coll. Automata, Languages and Programming (W. Brauer, ed.). Lect. Notes Comput. Sci. 194, 509\u2013519 (1985)","DOI":"10.1007\/BFb0015776"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268075.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00268075\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T19:21:06Z","timestamp":1554319266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00268075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["BF00268075"],"URL":"https:\/\/doi.org\/10.1007\/bf00268075","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}