{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T05:19:57Z","timestamp":1733203197230,"version":"3.30.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1007\/s004460050010","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T08:52:48Z","timestamp":1030265568000},"page":"61-75","source":"Crossref","is-referenced-by-count":6,"title":["Generating diagnostic information for behavioral preorders"],"prefix":"10.1007","volume":"9","author":[{"given":"Ufuk","family":"Celikkan","sequence":"first","affiliation":[]},{"given":"Rance","family":"Cleaveland","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50090061446_CR1","unstructured":"Fifth Annual Symposium on Logic in Computer Science (LICS\u201990), Philadelphia, June 1990. IEEE Computer Society Press"},{"key":"50090061446_CR2","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: Observation equivalence as a testing equivalence. Theor Comput Sci 53: 225\u2013241 (1987)","journal-title":"Theor Comput Sci"},{"key":"50090061446_CR3","series-title":"Lect Notes Comput Sci","first-page":"67","volume-title":"Stepwise refinement of distributed systems","author":"RJR Back","year":"1989","unstructured":"Back RJR: Refinement calculus. Part 2: parallel and reactive programs. In: Stepwise refinement of distributed systems. Lect Notes Comput Sci, vol 430. REX Workshop, Mook, The Netherlands, June 1989. Springer, Berlin Heidelberg New York, pp 67\u201393, 1989"},{"key":"50090061446_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-51305-1_7","volume-title":"Mathematics of program construction","author":"RJR Back","year":"1989","unstructured":"Back RJR, Sere K: Stepwise refinement of action systems. In: Mathematics of program construction. Lect Notes Comput Sci, vol 575. Gronningen, The Netherlands, June 1989. Springer, Berlin Heidelberg New York, pp 115\u2013138, 1989"},{"key":"50090061446_CR5","volume-title":"Process algebra. Cambridge Tracts in Theoretical Computer Science","author":"JCM Baeten","year":"1990","unstructured":"Baeten JCM, Weijland WP: Process algebra. Cambridge Tracts in Theoretical Computer Science, vol 18. Cambridge University Press, Cambridge, England, 1990"},{"key":"50090061446_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"JA Bergstra","year":"1985","unstructured":"Bergstra JA, Klop JW: Algebra of communicating processes with abstraction. Theoretical Comput Sci 37: 77\u2013121 (1985)","journal-title":"Theoretical Comput Sci"},{"key":"50090061446_CR7","first-page":"119","volume-title":"Proceedings of the North American Process Algebra Workshop, Workshops in Computing","author":"B Bloom","year":"1992","unstructured":"Bloom B, Paige R: Computing ready simulations efficiently. In: Proceedings of the North American Process Algebra Workshop, Workshops in Computing. Stony Brook, New York, August 1992. Springer, Berlin Heidelberg New York, pp 119\u2013134, 1992"},{"key":"50090061446_CR8","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, Brinksma E: Introduction to the ISO specification language LOTOS. Comput Networks ISDN Syst 14: 25\u201359 (1987)","journal-title":"Comput Networks ISDN Syst"},{"issue":"3","key":"50090061446_CR9","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes SD, Hoare CAR, Roscoe AW: A theory of communicating sequential processes. J Assoc Comput Machinery 31(3): 560\u2013599 (1984)","journal-title":"J Assoc Comput Machinery"},{"key":"50090061446_CR10","doi-asserted-by":"crossref","unstructured":"Burch JR, Clarke EM, McMillan KL, Dill DL, Hwang LJ: Symbolic model checking: 1020 states and beyond. In: Fifth Annual Symposium on Logic in Computer Science (LICS \u201990) [1], pp 428\u2013439","DOI":"10.1016\/0890-5401(92)90017-A"},{"key":"50090061446_CR11","doi-asserted-by":"crossref","unstructured":"Celikkan U, Cleaveland R: Computing diagnostic tests for incorrect processes. In: Proceedings of the IFIP Symposium on Protocol Specification, Testing and Verification. Lake Buena Vista, Florida, June 1992. North-Holland, pp 263\u2013278, 1992","DOI":"10.1016\/B978-0-444-89874-6.50023-4"},{"key":"50090061446_CR12","series-title":"Lect Notes Comput Sci","first-page":"364","volume-title":"Computer aided verification (CAV\u201990)","author":"R Cleaveland","year":"1990","unstructured":"Cleaveland R: On automatically explaining bisimulation inequivalence. In: Clarke EM, Kurshan RP (eds) Computer aided verification (CAV\u201990). Lect Notes Comput Sci, vol 531. Piscataway, NJ, June 1990. Springer, Berlin Heidelberg New York, pp 364\u2013372, 1990"},{"key":"50090061446_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01211314","volume":"5","author":"R Cleaveland","year":"1993","unstructured":"Cleaveland R, Hennessy MCB: Testing equivalence as a bisimulation equivalence. Formal Asp Comput 5: 1\u201320 (1993)","journal-title":"Formal Asp Comput"},{"issue":"1","key":"50090061446_CR14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R Cleaveland","year":"1993","unstructured":"Cleaveland R, Parrow J, Steffen B: The concurrency workbench: a semantics based tool for the verification of finite-state systems. ACM Trans Program Lang Syst 15(1): 36\u201372 (1993)","journal-title":"ACM Trans Program Lang Syst"},{"key":"50090061446_CR15","doi-asserted-by":"crossref","unstructured":"Cleaveland R, Steffen B: When is \u2018partial\u2019 adequate? A logic-based proof technique using partial specifications. In: Fifth Annual Symposium on Logic in Computer Science (LICS \u201990) [I], pp 440\u2013449","DOI":"10.1109\/LICS.1990.113768"},{"key":"50090061446_CR16","series-title":"Lect notes Comput Sci","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-54233-7_129","volume-title":"Automat, Languages and Programming (ICALP \u201991)","author":"R Cleaveland","year":"1991","unstructured":"Cleaveland R, Steffen B: Computing behavioural relations, logically. In: Leach Albert J, Monien B, Rodriguez Artalejo M (eds) Automat, Languages and Programming (ICALP \u201991). Lect notes Comput Sci, vol 510. Madrid, July 1991. Springer, Berlin Heidelberg New York, pp 127\u2013138, 1991"},{"key":"50090061446_CR17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01383878","volume":"2","author":"R Cleaveland","year":"1993","unstructured":"Cleaveland R, Steffen B: A linear-time model-checking algorithm for the alternation-free modal mu-calculus. Formal Methods Syst Design 2: 121\u2013147 (1993)","journal-title":"Formal Methods Syst Design"},{"key":"50090061446_CR18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R Nicola De","year":"1983","unstructured":"De Nicola R, Hennessy MCB: Testing equivalences for processes. Theor Comput Sci 34: 83\u2013133 (1983)","journal-title":"Theor Comput Sci"},{"key":"50090061446_CR19","volume-title":"Algebraic theory of processes","author":"MCB Hennessy","year":"1988","unstructured":"Hennessy MCB: Algebraic theory of processes. MIT Press, Boston, 1988"},{"issue":"1","key":"50090061446_CR20","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"MCB Hennessy","year":"1985","unstructured":"Hennessy MCB, Milner R: Algebraic laws for nondeterminism and concurrency. J Assoc Comput Machinery 32(1): 137\u2013161 (1985)","journal-title":"J Assoc Comput Machinery"},{"key":"50090061446_CR21","volume-title":"Communicating sequential processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare CAR: Communicating sequential processes. Prentice- Hall, London, 1985"},{"key":"50090061446_CR22","series-title":"Lect Notes Comput Sci","first-page":"13","volume-title":"Computer aided verification (CAV \u201991)","author":"H Korver","year":"1991","unstructured":"Korver H: Computing distinguishing formulas for branching bisimulation. In: Larsen KG, Skou A (eds) Computer aided verification (CAV \u201991). Lect Notes Comput Sci, vol 575. Aalborg, Denmark, July 1991. Springer, Berlin Heidelberg New York, pp 13\u201323, 1991"},{"key":"50090061446_CR23","volume-title":"TAV - tools for automatic verification","author":"KG Larsen","year":"1989","unstructured":"Larsen KG, Godskesen JC, Zeeberg M: TAV - tools for automatic verification. Tech Rep R 89-19. Aalborg University, Aalborg, Denmark, 1989"},{"key":"50090061446_CR24","volume-title":"Compositional proofs by partial specification of processes","author":"KG Larsen","year":"1987","unstructured":"Larsen KG, Thomsen B: Compositional proofs by partial specification of processes. Tech Rep R 87-20. Aalborg University, Aalborg, Denmark, July 1987"},{"key":"50090061446_CR25","doi-asserted-by":"crossref","unstructured":"Larsen KG, Thomsen B: A modal process logic. In: Third Annual Symposium on Logic in Computer Science (LICS \u201988) Edinburgh, Scotland, July 1988. IEEE Computer Society Press, pp 203\u2013210, 1988","DOI":"10.1109\/LICS.1988.5119"},{"key":"50090061446_CR26","volume-title":"Communication and concurrency","author":"R Milner","year":"1989","unstructured":"Milner R: Communication and concurrency. Prentice-Hall, London, 1989"},{"key":"50090061446_CR27","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: Modal logics for communicating systems. Theor Comput Sci 49: 311\u2013347(1987)","journal-title":"Theor Comput Sci"},{"key":"50090061446_CR28","doi-asserted-by":"crossref","unstructured":"Walker DJ: Bisimulation and divergence in CCS. In: Third Annual Symposium on Logic in Computer Science. Edinburgh, Scotland, July 1988. IEEE Computer Society Press, pp 186\u2013192, 1988","DOI":"10.1109\/LICS.1988.5117"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s004460050010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s004460050010\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s004460050010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:55:52Z","timestamp":1733187352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s004460050010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["50090061446"],"URL":"https:\/\/doi.org\/10.1007\/s004460050010","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}