{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:14Z","timestamp":1725456734141},"publisher-location":"Berlin\/Heidelberg","reference-count":21,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540508406"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029004","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:28:19Z","timestamp":1133414899000},"page":"421-433","source":"Crossref","is-referenced-by-count":7,"title":["Deciding bisimulation equivalences for a class of non-finite-state programs"],"prefix":"10.1007","author":[{"given":"Bengt","family":"Jonsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Parrow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"23","key":"36_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53(2,3):225\u2013241, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"36_CR2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. Brookes","year":"1984","unstructured":"S. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560\u2013599, 1984.","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"B. Bloom, S. Istrail, and A. Meyer. Bisimulation can't be traced: preliminary report. In Proc. 15th ACM PoPL, pages 229\u2013239, 1988.","key":"36_CR3","DOI":"10.1145\/73560.73580"},{"issue":"4\u20135","key":"36_CR4","first-page":"351","volume":"2","author":"D. Brand","year":"1978","unstructured":"D. Brand and W. H. Joyner. Verification of protocols using symbolic execution. Computer Networks, 2(4\u20135):351\u2013360, 1978.","journal-title":"Computer Networks"},{"issue":"5","key":"36_CR5","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1109\/TCOM.1982.1095558","volume":"COM-30","author":"D. Brand","year":"1982","unstructured":"D. Brand and W. H. Joyner. Verification of HDLC. IEEE Transactions on Communications, COM-30(5):1136\u20131142, 1982.","journal-title":"IEEE Transactions on Communications"},{"unstructured":"J. Bergstra and J. Klop. Verification of an Alternating Bit Protocol by means of Process Algebra. Technical Report, Centrum voor Wiskunde en Informatica, 1984.","key":"36_CR6"},{"doi-asserted-by":"crossref","unstructured":"E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logics specification: a practical approach. In Proc. 10th ACM PoPL, pages 117\u2013126, Austin, Texas, 1983.","key":"36_CR7","DOI":"10.1145\/567067.567080"},{"doi-asserted-by":"crossref","unstructured":"T. W. Doeppner and A. Giacalone. A formal description of the UNIX operating system. In Proc. 2nd ACM PoDC, pages 241\u2013253, 1983.","key":"36_CR8","DOI":"10.1145\/800221.806725"},{"issue":"2","key":"36_CR9","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1145\/322003.322016","volume":"24","author":"N. D. Jones","year":"1977","unstructured":"N. D. Jones and S. S. Muchnick. Even simple programs are hard to analyse. J. ACM, 24(2):338\u2013350, April 1977.","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. SICS Technical Report, In preparation.","key":"36_CR10","DOI":"10.1007\/BFb0029004"},{"issue":"1","key":"36_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(85)90002-4","volume":"5","author":"C. Koomen","year":"1985","unstructured":"C. Koomen. Algebraic specification and verification of protocols. Science of Computer Programming, 5(1):1\u201336, 1985.","journal-title":"Science of Computer Programming"},{"doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. In Proc. 2nd ACM PoDC, pages 228\u2013240, Montreal, Canada, 1983.","key":"36_CR12","DOI":"10.1145\/800221.806724"},{"doi-asserted-by":"crossref","unstructured":"K. G. Larsen and R. Milner. Verifying a protocol using relativized bisimulation. In Proc. ICALP '87, LNCS 267, Springer Verlag, 1987.","key":"36_CR13","DOI":"10.1007\/3-540-18088-5_11"},{"doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems. Volume 92 of Lecture Notes of Computer Science, Springer Verlag, 1980.","key":"36_CR14","DOI":"10.1007\/3-540-10235-3"},{"key":"36_CR15","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"key":"36_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"R. de Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"unstructured":"J. Parrow. Verifying a CSMA\/CD-Protocol with CCS. Technical Report ECS-LFCS-87-18, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1987. To appear in Protocol Specification, Testing, and Verification VIII (1988).","key":"36_CR17"},{"unstructured":"S.A. Smolka, A.J. Frank, and S.K. Debray. Testing protocol robustness the CCS way. In Protocol Specification, Testing, and Verification IV (1984), pages 93\u2013108, 1985. North-Holland.","key":"36_CR18"},{"unstructured":"D. Vergamini. Verification by means of Observation Equivalence on Automata. Technical Report 501, INRIA, Sophia Antipolis, 1986.","key":"36_CR19"},{"unstructured":"M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. IEEE Symp. on Logic in Computer Science, pages 332\u2013344, June 1986.","key":"36_CR20"},{"doi-asserted-by":"crossref","unstructured":"P. Wolper. Expressing interesting properties of programs in propositional temporal logic (extended abstract). In Proc. 13th ACM PoPL, pages 184\u2013193, Jan. 1986.","key":"36_CR21","DOI":"10.1145\/512644.512661"}],"container-title":["Lecture Notes in Computer Science","STACS 89"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:07Z","timestamp":1586592907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540508406"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0029004","relation":{},"subject":[]}}