{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:03Z","timestamp":1725663663114},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_108","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:48:29Z","timestamp":1330192109000},"page":"480-494","source":"Crossref","is-referenced-by-count":0,"title":["Experiments on processes with backtracking"],"prefix":"10.1007","author":[{"given":"Ph.","family":"Schnoebelen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"34_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:225\u2013241, 1987.","journal-title":"Theoretical Computer Science"},{"key":"34_CR2","unstructured":"J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Ready Trace Semantics for Concrete Process Algebra with Priority Operator. Research Report CS-R8517, CWI, 1985."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can't be traced: preliminary report. In Proc. 15th ACM Symp. Principles of Programming Languages, San Diego, CA, pages 229\u2013239, January 1988.","DOI":"10.1145\/73560.73580"},{"key":"34_CR4","unstructured":"J. A. Bergstra and J. W. Klop. Algebra of communicating processes. In J. W. de Bakker et al., editor, CWI Monographs I, Proc. CWI Symp. Math. and Comp. Sci., pages 89\u2013138, North-Holland, 1986."},{"issue":"6","key":"34_CR5","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1137\/0217073","volume":"17","author":"J. A. Bergstra","year":"1988","unstructured":"J. A. Bergstra, J. W. Klop, and E.-R. Olderog. Readies and failures in the algebra of communicating processes. SIAM Journal on Computing, 17(6):1134\u20131177, December 1988.","journal-title":"SIAM Journal on Computing"},{"key":"34_CR6","series-title":"Tech. Report","volume-title":"Partial Traces and the Semantics and Logic of CCS-Like languages","author":"B. Bloom","year":"1989","unstructured":"B. Bloom. Partial Traces and the Semantics and Logic of CCS-Like languages. Tech. Report 89-1066, Cornell University, Ithaca, NY, December 1989."},{"key":"34_CR7","unstructured":"B. Bloom. Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages. PhD thesis, MIT, September 1989."},{"key":"34_CR8","unstructured":"R. De Nicola and F. Vaandrager. Three logics for branching bisimulation (extended abstract). In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, PA, pages 118\u2013129, June 1990."},{"key":"34_CR9","first-page":"332","volume":"458","author":"J. F. Groote","year":"1990","unstructured":"J. F. Groote. Transition system specifications with negative premisses. In Proc. CONCUR'90, Amsterdam, LNCS 458, pages 332\u2013341, Springer-Verlag, August 1990.","journal-title":"LNCS"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"J. F. Groote and F. W. Vaandrager. Structured Operational Semantics and Bisimulation as a Congruence. Research Report CS-R8845, CWI, November 1988.","DOI":"10.1007\/BFb0035774"},{"key":"34_CR11","first-page":"299","volume":"85","author":"M. Hennessy","year":"1980","unstructured":"M. Hennessy and R. Milner. On observing nondeterminism and concurrency. In Proc. 7th ICALP, Noordwijkerhout, LNCS 85, pages 299\u2013309, Springer-Verlag, July 1980.","journal-title":"LNCS"},{"issue":"1","key":"34_CR12","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. Journal of the ACM, 32(1):137\u2013161, January 1985.","journal-title":"Journal of the ACM"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. In Proc. 16th ACM Symp. Principles of Programming Languages, Austin, Texas, pages 344\u2013352, January 1989.","DOI":"10.1145\/75277.75307"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems. LNCS 92, Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"34_CR15","first-page":"25","volume":"112","author":"R. Milner","year":"1981","unstructured":"R. Milner. A model characterisation of observable machine-behaviour. In Proc. CAAP 81, Genoa, LNCS 112, pages 25\u201334, Springer-Verlag, March 1981.","journal-title":"LNCS"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"R. Milner. Operational and algebraic semantics of concurrent processes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 19, pages 1201\u20131242, Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"34_CR17","first-page":"167","volume":"104","author":"D. Park","year":"1981","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conf. on Th. Comp. Sci., LNCS 104, pages 167\u2013183, Springer-Verlag, March 1981.","journal-title":"LNCS"},{"key":"34_CR18","first-page":"15","volume":"194","author":"A. Pnueli","year":"1985","unstructured":"A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In Proc. 12th ICALP, Nafplion, LNCS 194, pages 15\u201332, Springer-Verlag, July 1985.","journal-title":"LNCS"},{"key":"34_CR19","series-title":"Research Report","volume-title":"Experiments on Processes with Backtracking","author":"P. Schnoebelen","year":"1991","unstructured":"Ph. Schnoebelen. Experiments on Processes with Backtracking. Research Report, LIFIAIMAG, Grenoble, June 1991."},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"R. J. van Glabbeek. The Linear Time \u2014 Branching Time Spectrum. Research Report CS-R9029, CWI, July 1990.","DOI":"10.1007\/BFb0039066"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"R. J. van Glabbeek, S. A. Smolka, B. Steffen, and C. M. N. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, PA, pages 130\u2013141, June 1990.","DOI":"10.1109\/LICS.1990.113740"}],"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_108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:54:19Z","timestamp":1605628459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_108","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}