{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:48Z","timestamp":1725536328680},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03564-7_3","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T03:05:35Z","timestamp":1250737535000},"page":"47-77","source":"Crossref","is-referenced-by-count":0,"title":["Process Algebra: An Algebraic Theory of Concurrency"],"prefix":"10.1007","author":[{"given":"Wan","family":"Fokkink","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/B978-044482830-9\/50021-7","volume-title":"Handbook of Process Algebra","author":"L. Aceto","year":"2001","unstructured":"Aceto, L., Fokkink, W.J., Verhoef, C.: Structural operational semantics. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 197\u2013292. Elsevier, Amsterdam (2001)"},{"issue":"2-3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2004.07.036","volume":"335","author":"J.C.M. Baeten","year":"2005","unstructured":"Baeten, J.C.M.: A brief history of process algebra. Theoretical Computer Science\u00a0335(2-3), 131\u2013146 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"3_CR3","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/362946.362970","volume":"12","author":"K.A. Bartlett","year":"1969","unstructured":"Bartlett, K.A., Scantlebury, R.A., Wilkinson, P.T.: A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM\u00a012(5), 260\u2013261 (1969)","journal-title":"Communications of the ACM"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T. Basten","year":"1996","unstructured":"Basten, T.: Branching bisimilarity is an equivalence indeed! Information Processing Letters\u00a058(3), 141\u2013147 (1996)","journal-title":"Information Processing Letters"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/77600.77621","volume":"37","author":"J. Bergstra","year":"1990","unstructured":"Bergstra, J., Heering, J., Klint, P.: Module algebra. Journal of the ACM\u00a037(2), 335\u2013372 (1990)","journal-title":"Journal of the ACM"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-44585-4_23","volume-title":"Computer Aided Verification","author":"S. Blom","year":"2001","unstructured":"Blom, S., Fokkink, W.J., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.: \u03bcCRL: A toolset for analysing algebraic specification. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 250\u2013254. Springer, Heidelberg (2001)"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R. Nicola De","year":"1995","unstructured":"De Nicola, R., Vaandrager, F.W.: Three logics for branching bisimulation. Journal of the ACM\u00a042(2), 458\u2013487 (1995)","journal-title":"Journal of the ACM"},{"key":"3_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04293-9","volume-title":"Introduction to Process Algebra","author":"W.J. Fokkink","year":"2000","unstructured":"Fokkink, W.J.: Introduction to Process Algebra. Springer, Heidelberg (2000)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1006\/jcss.1999.1663","volume":"60","author":"W.J. Fokkink","year":"2000","unstructured":"Fokkink, W.J.: Rooted branching bisimulation as a congruence. Journal of Computer and System Sciences\u00a060(1), 13\u201337 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR10","volume-title":"Modelling Distributed Systems","author":"W.J. Fokkink","year":"2007","unstructured":"Fokkink, W.J.: Modelling Distributed Systems. Springer, Heidelberg (2007)"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/inco.1998.2729","volume":"146","author":"W.J. Fokkink","year":"1998","unstructured":"Fokkink, W.J., Verhoef, C.: A conservative look at operational semantics with variable binding. Information and Computation\u00a0146(1), 24\u201354 (1998)","journal-title":"Information and Computation"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/3-540-57182-5_39","volume-title":"Mathematical Foundations of Computer Science 1993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 473\u2013484. Springer, Heidelberg (1993)"},{"key":"3_CR13","unstructured":"van Glabbeek, R.J.: What is branching time and why to use it? In: Nielsen, M. (ed.) The Concurrency Column. Bulletin of the EATCS, vol.\u00a053, pp. 190\u2013198 (1994)"},{"key":"3_CR14","unstructured":"Groote, J.F.: Process Algebra and Structured Operational Semantics. PhD thesis, University of Amsterdam (1991)"},{"key":"3_CR15","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/BFb0032072","volume-title":"Automata, Languages and Programming","author":"F. Moller","year":"1990","unstructured":"Moller, F.: The importance of the left merge operator in process algebras. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 752\u2013764. Springer, Heidelberg (1990)"},{"key":"3_CR17","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1998","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"3_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3550-5","volume-title":"Modal and Temporal Properties of Processes","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. Springer, Heidelberg (2001)"},{"key":"3_CR19","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"1981","unstructured":"Tanenbaum, A.S.: Computer Networks. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"3_CR20","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"issue":"2","key":"3_CR21","first-page":"274","volume":"2","author":"C. Verhoef","year":"1995","unstructured":"Verhoef, C.: A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing\u00a02(2), 274\u2013302 (1995)","journal-title":"Nordic Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:24:51Z","timestamp":1552119891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}