{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:11Z","timestamp":1725663671832},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54430-5_82","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:49:09Z","timestamp":1330192149000},"page":"78-95","source":"Crossref","is-referenced-by-count":4,"title":["A theory of testing for ACP"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"D. Austry and G. Boudol, Algebre de Processus et synchronisations, TCS 30(1), pp. 91\u2013131","DOI":"10.1016\/0304-3975(84)90067-7"},{"key":"8_CR2","unstructured":"L. Aceto, A theory of Testing for ACP, Report 3\/90, Dept. of Computer Science, University of Sussex, May 1990"},{"key":"8_CR3","unstructured":"L. Aceto and M. Hennessy, Termination, Deadlock and Divergence, Report 6\/88, Dept. of Computer Science, University of Sussex, 1988. To appear in the Journal of the ACM."},{"key":"8_CR4","unstructured":"J. C. M. Baeten and R. J. van Glabbeek, Abstraction and Empty Process in Process Algebra, Report CS-R8721, CWI Amsterdam, 1987 (to appear in Fundamenta Informaticae)"},{"issue":"3","key":"8_CR5","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. D. Brookes","year":"1984","unstructured":"S. D. Brookes, C. A. R. Hoare and A. W. Roscoe, A Theory of Communicating Sequential Processes, JACM 31,3, pp. 560\u2013599, 1984","journal-title":"JACM"},{"issue":"1","key":"8_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. A. Bergstra","year":"1985","unstructured":"J. A. Bergstra and J. W. Klop, Algebra of Communicating Processes with Abstraction, TCS 37, 1, pp. 77\u2013121, 1985","journal-title":"TCS"},{"key":"8_CR7","unstructured":"J. A. Bergstra, J. W. Klop and E.-R. Olderog, Failures Without Chaos: a New Process Semantics for Fair Abstraction, Formal Description of Programming Concepts-III (M. Wirsing ed.), North-Holland, 1987"},{"key":"8_CR8","volume-title":"An Algebra for Process Creation, Report CS-R8907","author":"J. C. M. Baeten","year":"1989","unstructured":"J. C. M. Baeten and F. Vaandrager, An Algebra for Process Creation, Report CS-R8907, CWI, Amsterdam, 1989"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"I. Castellani and M. Hennessy, Distributed Bisimulations, JACM, October 1989","DOI":"10.1145\/76359.76369"},{"issue":"1\u20133","key":"8_CR10","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(85)80048-6","volume":"64","author":"R. Nicola de","year":"1985","unstructured":"R. de Nicola, Two Complete Sets of Axioms for a Theory of Communicating Sequential Processes, Information and Control 64(1\u20133), pp. 136\u2013176, 1985","journal-title":"Information and Control"},{"issue":"1","key":"8_CR11","first-page":"83","volume":"34","author":"R. Nicola De","year":"1987","unstructured":"R. De Nicola and M. Hennessy, Testing Equivalences for Processes, TCS 34,1, pp. 83\u2013134, 1987","journal-title":"TCS"},{"key":"8_CR12","first-page":"138","volume":"249","author":"R. Nicola de","year":"1987","unstructured":"R. de Nicola and M. Hennessy, CCS without r's, in Proceedings TAPSOFT 87, LNCS 249, pp. 138\u2013152, Springer-Verlag, 1987","journal-title":"LNCS"},{"key":"8_CR13","volume-title":"Modular Specifications in Process Algebra-with Curious Queues, Report CS-R8821","author":"R. Glabbeek van","year":"1988","unstructured":"R. van Glabbeek and F. Vaandrager, Modular Specifications in Process Algebra-with Curious Queues, Report CS-R8821, CIW, Amsterdam, 1988"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"I. Guessarian, Algebraic Semantics, LNCS 99, Springer-Verlag, 1981","DOI":"10.1007\/3-540-10284-1"},{"key":"8_CR15","unstructured":"M. Hennessy, Algebraic Theory of Processes, MIT Press, 1988"},{"key":"8_CR16","unstructured":"M. Hennessy and A. Ing\u00f3lfsd\u00f3ttir, A Theory of Communicating Processes with Value Passing, Report 3\/89, University of Sussex, 1989"},{"issue":"1","key":"8_CR17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner, Algebraic Laws for Nondeterminism and Concurrency, JACM 32,1, pp. 137\u2013161, 1985","journal-title":"JACM"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985","DOI":"10.1007\/978-3-642-82921-5_4"},{"issue":"7","key":"8_CR19","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1145\/360248.360251","volume":"19","author":"R. Keller","year":"1976","unstructured":"R. Keller, Formal Verification of Parallel Programs, C. ACM 19,7, pp. 561\u2013572, 1976","journal-title":"C. ACM"},{"key":"8_CR20","unstructured":"R. Milner, Communication and Concurrency, Prentice-Hall, 1989"},{"key":"8_CR21","unstructured":"F. Moller, Axioms for Concurrency, Ph. D. Thesis, University of Edinburgh, 1989"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"D. Park, Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science vol. 104, Springer-Verlag, 1981","DOI":"10.1007\/BFb0017309"},{"key":"8_CR23","unstructured":"G. Plotkin, A Structural Approach to Operational Semantics, Report DAIMI FN-19, Computer Science Dept., Aarhus University, 1981"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"F. Vaandrager, Process Algebra Semantics of POOL, to appear in Applications of Process Algebra (J.C.M. Baeten ed.), pp. 173\u2013236, 1990","DOI":"10.1017\/CBO9780511608841.010"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"F. Vaandrager, Two Simple Protocols, to appear in Applications of Process Algebra (J.C.M. Baeten ed.), pp. 237\u2013260, 1990","DOI":"10.1017\/CBO9780511608841.011"},{"key":"8_CR26","unstructured":"J. L. M. Vrancken, The Algebra of Communicating Processes with Empty Process, Report FVI 86-01, Dept. of Computer Science, University of Amsterdam, 1986"}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T22:48:16Z","timestamp":1640904496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}