{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:16Z","timestamp":1742617156913,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564966"},{"type":"electronic","value":"9783540475729"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56496-9_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:12:48Z","timestamp":1330254768000},"page":"370-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Generating diagnostic information for behavioral preorders"],"prefix":"10.1007","author":[{"given":"Ufuk","family":"Celikkan","sequence":"first","affiliation":[]},{"given":"Ranee","family":"Cleaveland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"Abramsky, S., \u201cObservation Equivalence as a Testing Equivalence\u201d, Theoretical Computer Science, vol. 53, (1987), 225\u2013241.","journal-title":"Theoretical Computer Science"},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., and J.W. Klop, \u201cProcess Algebra for Synchronous Communication\u201d, Information and Control 60, (1984), 109\u2013137.","journal-title":"Information and Control"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","volume":"14","author":"T. Bolognesi","year":"1987","unstructured":"Bolognesi, T. and E. Brinksma, \u201cIntroduction to the ISO Specification Language LOTOS\u201d, Computer Networks and ISDN Systems, vol. 14, (1987), 25\u201359.","journal-title":"Computer Networks and ISDN Systems"},{"issue":"no.3","key":"29_CR4","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. D. Brookes","year":"1984","unstructured":"Brookes, S.D., C.A.R. Hoare, and A.W. Roscoe, \u201cA Theory of Communicating Sequential Processes\u201d, Journal of the ACM, vol. 31, no. 3, (1984),560\u2013599.","journal-title":"Journal of the ACM"},{"key":"29_CR5","unstructured":"Burch, J.R., E.M. Clarke, K.C McMillan, D.L. Dill, L.J. Hwang. \u201cSymbolic Model Checking: 1020 States and Beyond,\u201d In Proceedings LICS'90, (1990)."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Celikkan, U., and R. Cleaveland, \u201cComputing Diagnostic Tests for Incorrect Processes\u201d In Proceedings of the Protocol Specification Testing and Verification, 12, 1992.","DOI":"10.1016\/B978-0-444-89874-6.50023-4"},{"key":"29_CR7","first-page":"11","volume":"407","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland, R., and M. Hennessy, \u201cTesting Equivalence as a Bisimulation Equivalence\u201d, In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Syitems, LNCS 407, (1989), 11\u201323. To appear in Fundamental Aspects of Computing.","journal-title":"LNCS"},{"key":"29_CR8","first-page":"24","volume":"407","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland, R., J. Parrow, and B. Steften, \u201cThe Concurrency Workbench\u201d, In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, LNCS 407, (1989), 24\u201337.","journal-title":"LNCS"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., \u201cOn Automatically Distinguishing Inequivalent Processes\u201d, In Proceedings of the Workshop on Computer-Aided Verification, 1990.","DOI":"10.1090\/dimacs\/003\/28"},{"key":"29_CR10","unstructured":"Cleaveland, R., and B. Steffen, \u201cWhen is \u2018Partial\u2019 Adequate? A Logic Based Proof Technique Using Partial Specifications\u201d, In Proceedings LICS'90, (1990)."},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., and B. Steffen, \u201cComputing Behavioral Relations, Logically\u201d, In Proceedings of ICALP'90, (1991).","DOI":"10.1007\/3-540-54233-7_129"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"24","author":"R. DeNicola","year":"1984","unstructured":"DeNicola, R., and M.C.B. Hennessy, \u201cTesting Equivalences for Processes\u201d, Theoretical Computer Science, vol. 24, (1984), 83\u2013113.","journal-title":"Theoretical Computer Science"},{"key":"29_CR13","unstructured":"Godskeen, J.C., K.G. Larsen, and M. Zeeberg, \u201cTAV-Tools for automatic verification\u201d, R89-19, Aalborg University, Denmark."},{"issue":"no.1","key":"29_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., and R. Milner, \u201cAlgebraic Laws for Nondeterminism and Concurrency\u201d, Journal of the Association for Computing Machinery, vol. 32, no. 1, (January 1985), 147\u2013161.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"29_CR15","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M., Algebraic Theory of Processes, MIT Press, Boston, 1988."},{"key":"29_CR16","volume-title":"Communicating Sequential Processes","author":"C. A. R. R. Hoare","year":"1985","unstructured":"Hoare, C.A.R., Communicating Sequential Processes, Prentice-Hall, London, 1985."},{"key":"29_CR17","unstructured":"Larsen, K.G., and B. Thomsen, \u201cCompositional Proofs by Partial Specification of Processes\u201d, Report R 87-20, University of Aalborg, July 1987."},{"key":"29_CR18","unstructured":"Milner, R., Communication and Concurrency, Prentice Hall, 1989."},{"key":"29_CR19","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"Stirling, C., \u201cModal Logics for Communicating Systems\u201d, Theoretical Computer Science, vol. 49, (1987), 311\u2013347.","journal-title":"Theoretical Computer Science"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Walker, D., \u201cBisimulations and Divergence\u201d, In Proceedings of the Third Annual Symposium on Logic in Computer Science, (1988), 186\u2013192.","DOI":"10.1109\/LICS.1988.5117"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56496-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:48:48Z","timestamp":1742593728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56496-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564966","9783540475729"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-56496-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}