{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:55Z","timestamp":1725559195266},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258131"},{"type":"electronic","value":"9783540322658"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11423348_3","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T06:36:01Z","timestamp":1279089361000},"page":"36-60","source":"Crossref","is-referenced-by-count":5,"title":["Process Algebra: A Unifying Approach"],"prefix":"10.1007","author":[{"given":"Tony","family":"Hoare","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a037(1), 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BFb0036899","volume-title":"Automata, Languages and Programming","author":"S.D. Brookes","year":"1983","unstructured":"Brookes, S.D.: On the relationship of CCS and CSP. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 83\u201396. Springer, Heidelberg (1983)"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0304-3975(03)00200-7","volume":"309","author":"P.H.B. Gardiner","year":"2003","unstructured":"Gardiner, P.H.B.: Power simulation and its relation to Traces and Failures Refinement. Theoretical Computer Science\u00a0309(1), 157\u2013176 (2003)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","volume-title":"Communication and concurrency.","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M.R. Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","volume":"50","author":"I.C.C. Phillips","year":"1987","unstructured":"Phillips, I.C.C.: Refusal testing. Theoretical Computer Science\u00a050(3), 241\u2013284 (1987)","journal-title":"Theoretical Computer Science"},{"key":"3_CR8","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University (1981)"},{"key":"3_CR9","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)"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(96)00251-4","volume":"177","author":"R.J. Glabbeek van","year":"1997","unstructured":"van Glabbeek, R.J.: Notes on the methodology of CCS and CSP. Theoretical Computer Science\u00a0177(2), 329\u2013349 (1997)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Communicating Sequential Processes. The First 25 Years"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11423348_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:12:02Z","timestamp":1558296722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11423348_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258131","9783540322658"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11423348_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}