{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300001},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572084"},{"type":"electronic","value":"9783540479680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57208-2_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:18:56Z","timestamp":1330240736000},"page":"477-492","source":"Crossref","is-referenced-by-count":29,"title":["A congruence theorem for structured operational semantics with predicates"],"prefix":"10.1007","author":[{"given":"J. C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"C.","family":"Verhoef","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/147508.147527","volume":"39","author":"L. Aceto","year":"1992","unstructured":"L. Aceto, M. Hennessy, Termination, deadlock and divergence, JACM 39(1):147\u2013187, 1992.","journal-title":"JACM"},{"unstructured":"J. C. M. Baeten, J. A. Bergstra, Discrete Time Process Algebra, Report P9208b, Programming Research Group, University of Amsterdam, 1992.","key":"33_CR2"},{"key":"33_CR3","series-title":"LNCS 458","first-page":"83","volume-title":"Proceedings CONCUR 90","author":"J. C. M. M. Baeten","year":"1990","unstructured":"J. C. M. Baeten, J. A. Bergstra, Process algebra with a zero object, in: J. C. M. Baeten and J. W. Klop, editors, Proceedings CONCUR 90, Amsterdam, LNCS 458, pp. 83\u201398, Springer-Verlag, 1990."},{"issue":"1\/2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J. C. M. M. Baeten","year":"1987","unstructured":"J. C. M. Baeten, J. A. Bergstra, J. W. Klop, On the consistency of Koomen's fair abstraction rule, TCS 51(1\/2), pp. 129\u2013176, 1987.","journal-title":"TCS"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-1986-9202","volume":"IX","author":"J. C. M. M. Baeten","year":"1986","unstructured":"J. C. M. Baeten, J. A. Bergstra, J. W. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fundamenta Informaticae IX, pp. 127\u2013168, 1986.","journal-title":"Fundamenta Informaticae"},{"key":"33_CR6","series-title":"LNCS 287","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-18625-5_49","volume-title":"Proceedings 7th Conference on Foundations of Software Technology and Theoretical Computer Science","author":"J. C. M. M. Baeten","year":"1987","unstructured":"J. C. M. Baeten, R. J. van Glabbeek, Merge and termination in process algebra, in: K. V. Nori, editor, Proceedings 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, LNCS 287, pp. 153\u2013172, Springer-Verlag, 1987."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01178776","volume":"29","author":"J. C. M. M. Baeten","year":"1992","unstructured":"J. C. M. Baeten and F. W. Vaandrager, An algebra for process creation, Acta Informatica 29, pp. 303\u2013334, 1992.","journal-title":"Acta Informatica"},{"doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten, W. P. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.","key":"33_CR8","DOI":"10.1017\/CBO9780511624193"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. A. Bergstra","year":"1985","unstructured":"J. A. Bergstra, J. W. Klop, Algebra of communicating processes with abstraction, TCS 37, 77\u2013121, 1985.","journal-title":"TCS"},{"key":"33_CR10","volume-title":"MC report IW 206","author":"J. A. Bergstra","year":"1982","unstructured":"J. A. Bergstra, J. W. Klop, Fixed point semantics in process algebras, MC report IW 206, Mathematical Centre, Amsterdam, 1982. Revised version: J. A. Bergstra, J. W. Klop, A convergence theorem in process algebra, in Ten years of concurrency semantics: selected papers of the Amsterdam Concurrency Group, editors J. W. de Bakker, J. J. M. M. Rutten, World Scientific, pp. 164\u2013195, 1992."},{"key":"33_CR11","first-page":"229","volume-title":"Proceedings 15th ACM Symposium on Principles of Programming Languages","author":"B. Bloom","year":"1988","unstructured":"B. Bloom, S. Istrail, and A. R. Meyer, Bisimulation can't be traced: preliminary report, In: Proceedings 15th ACM Symposium on Principles of Programming Languages, San Diego, California, pp. 229\u2013239, 1988."},{"unstructured":"W. J. Fokkink, personal communication, January 1993.","key":"33_CR12"},{"doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J.A. Goguen, J.-P. Jouannaud, J. Meseguer, Principles of OBJ2, in Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, editor B. Reid, pp. 52\u201366, ACM, 1985.","key":"33_CR13","DOI":"10.1145\/318593.318610"},{"doi-asserted-by":"crossref","unstructured":"R. J. van Glabbeek, Bounded nondeterminism and the approximation induction principle in process algebra, In: Proceedings STACS 87 (F. J. Brandenburg, G. Vidal-Naquet, M. Wirsing, eds.), LNCS 247, Springer Verlag, pp. 336\u2013347, 1987.","key":"33_CR14","DOI":"10.1007\/BFb0039617"},{"key":"33_CR15","volume-title":"Report CS-R9850","author":"J. F. Groote","year":"1989","unstructured":"J. F. Groote, Transition system specifications with negative premises, Report CS-R9850, CWI, Amsterdam, 1989. An extended abstract appeared in: see [3] pp. 332\u2013341."},{"issue":"2","key":"33_CR16","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J. F. Groote","year":"1992","unstructured":"J. F. Groote and F. W. Vaandrager, Structured operational semantics and bisimulation as a congruence, Information and Computation 100(2), pp. 202\u2013260, 1992.","journal-title":"Information and Computation"},{"unstructured":"A. Ing\u00f3lfsd\u00f3ttir, B. Thomsen, Semantic Models for CCS with Values, in: Proceedings Chalmers Workshop on Concurrency, 1991, pp. 215\u2013242, Report PMG-R63, Chalmers University of Technology and University of G\u00f6teborg, 1992.","key":"33_CR17"},{"doi-asserted-by":"crossref","unstructured":"A. S. Klusener, Completeness in real time process algebra, Technical Report CS-R9106, CWI, Amsterdam, 1991. An extended abstract appeared in J. C. M. Baeten and J. F. Groote, editors, Proceedings CONCUR 91, Amsterdam, LNCS 527, pp. 376\u2013392, 1991.","key":"33_CR18","DOI":"10.1007\/3-540-54430-5_101"},{"unstructured":"C. P. J. Koymans and J. L. M. Vrancken, Extending process algebra with the empty process \u025b, Logic Group Preprint Series Nr. 1, CIF, Utrecht University, 1985.","key":"33_CR19"},{"doi-asserted-by":"crossref","unstructured":"R. Milner, A calculus of communicating systems, LNCS 92, Springer Verlag, 1980.","key":"33_CR20","DOI":"10.1007\/3-540-10235-3"},{"key":"33_CR21","series-title":"LNCS 458","first-page":"401","volume-title":"Proceedings CONCUR 90","author":"F. Moller","year":"1990","unstructured":"F. Moller and C. Tofts, A Temporal Calculus of Communicating Systems, in: see [3], pp. 401\u20134151990."},{"doi-asserted-by":"crossref","unstructured":"D. M. R. Park, Concurrency and automata on infinite sequences, In P. Duessen (ed.) 5th GI Conference, LNCS 104, pp. 167\u2013183, Springer-Verlag, 1981.","key":"33_CR22","DOI":"10.1007\/BFb0017309"},{"unstructured":"G. D. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.","key":"33_CR23"},{"doi-asserted-by":"crossref","unstructured":"S. Schneider, An Operational Semantics for Timed CSP, in: see [17] pp. 428\u2013456. To appear in Information and Computation.","key":"33_CR24","DOI":"10.1006\/inco.1995.1014"},{"key":"33_CR25","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"R. de Simone, Higher-level synchronising devices in Meije-SCCS, TCS 37, pp. 245\u2013267, 1985.","journal-title":"TCS"},{"unstructured":"Wang Yi, Towards a Theory of Testing for CCS with Probability, in: see [17] pp. 476\u2013492.","key":"33_CR26"}],"container-title":["Lecture Notes in Computer Science","CONCUR'93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57208-2_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:17:33Z","timestamp":1640909853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57208-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572084","9783540479680"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-57208-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}