{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:16Z","timestamp":1759638976990},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_129","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:39:12Z","timestamp":1330191552000},"page":"127-138","source":"Crossref","is-referenced-by-count":45,"title":["Computing behavioural relations, logically"],"prefix":"10.1007","author":[{"given":"Rance","family":"Cleaveland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"30","key":"9_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(88)90029-4","volume":"29","author":"A. Arnold","year":"1988","unstructured":"Arnold, A., and P. Crubille. \u201cA Linear Algorithm To Solve Fixed-Point Equations on Transition Systems.\u201d Information Processing Letters, v. 29, 30 September 1988, pp. 57\u201366.","journal-title":"Information Processing Letters"},{"unstructured":"Boudol, G., de Simone, R. and Vergamini, D. \u201cExperiment with Auto and Autograph on a Simple Case Sliding Window Protocol.\u201d INRIA Report 870, July 1988.","key":"9_CR2"},{"issue":"2","key":"9_CR3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke, E.M., E.A. Emerson and Sistla, A.P. \u201cAutomatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications.\u201d ACM Transactions on Programming Languages and Systems, v. 8, n. 2, 1986, pp. 244\u2013263.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"doi-asserted-by":"crossref","unstructured":"Cleaveland, R. \u201cTableau-Based Model Checking in the Propositional Mu-Calculus.\u201d Acta Informatica, 1990.","key":"9_CR4","DOI":"10.1007\/BF00264284"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science series","volume-title":"Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland, R. and Hennessy, M.C.B. \u201cTesting Equivalence as a Bisimulation Equivalence.\u201d In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems. Lecture Notes in Computer Science series 407, Springer-Verlag, Berlin, 1989."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","first-page":"24","volume-title":"Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland, R., Parrow, J. and Steffen, B. \u201cThe Concurrency Workbench.\u201d In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, 1989, Lecture Notes in Computer Science 407, pp. 24\u201337. Springer-Verlag, Berlin."},{"unstructured":"Cleaveland, R., Parrow, J. and B. Steffen. A Semantics based Verification Tool for Finite State Systems, In pro. of the Ninth International Symposium on Protocol Specification, Testing, and Verification; North Holland, 1989.","key":"9_CR7"},{"unstructured":"Cleaveland, R. and Steffen, B. \u201cWhen is \u2018Partial\u2019 Complete? A Logic-Based Proof Technique using Partial Specifications.\u201d In Proceedings LICS'90, 1990.","key":"9_CR8"},{"key":"9_CR9","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 Hennessy, M.C.B. \u201cTesting Equivalences for Processes.\u201d Theoretical Computer Science 24, 1984, pp. 83\u2013113.","journal-title":"Theoretical Computer Science"},{"unstructured":"Emerson, E.A. and Lei, C.-L. \u201cEfficient Model Checking in Fragments of the Propositional Mu-Calculus.\u201d In Proceedings of the First Annual Symposium on Logic in Computer Science, 1986, pp. 267\u2013278.","key":"9_CR10"},{"unstructured":"Fernandez, J.-C. Ald\u00e9baran: Une Syst\u00e8me de V\u00e9rification par R\u00e9duction de Processus Communicants. Ph.D. Thesis, Universit\u00e9 de Grenoble, 1988.","key":"9_CR11"},{"unstructured":"Graf, S. and Steffen, B. \u201cUsing Interface Specifications for Compositional Reduction.\u201d To appear in Proceedings of the Workshop on Computer-Aided Verification.","key":"9_CR12"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D. \u201cResults on the Propositional \u03bc-Calculus.\u201d Theoretical Computer Science, v. 27, 1983, pp. 333\u2013354.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Larsen, K.G. \u201cProof Systems for Hennessy-Milner Logic with Recursion.\u201d In Proceedings of CAAP, 1988.","key":"9_CR14","DOI":"10.1007\/BFb0026106"},{"key":"9_CR15","volume-title":"Proceedings of the Workshop on Specification and Verification of Concurrent Systems","author":"J. Malhotra","year":"1988","unstructured":"Malhotra, J., Smolka, S.A., Giacalone, A. and Shapiro, R. \u201cWinston: A Tool for Hierarchical Design and Simulation of Concurrent Systems.\u201d In Proceedings of the Workshop on Specification and Verification of Concurrent Systems, University of Stirling, Scotland, 1988."},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92. Springer-Verlag, Berlin, 1980."},{"unstructured":"Milner, R. Communication and Concurrency, Prentice Hall, 1989.","key":"9_CR17"},{"doi-asserted-by":"crossref","unstructured":"Plotkin, G. and Stirling, C. \u201cA Framework for Intuitionistic Modal Logics.\u201d Theoretical Aspects of Reasoning about Knowledge, Monterey, 1986.","key":"9_CR18","DOI":"10.1016\/B978-0-934613-04-0.50032-6"},{"unstructured":"Richier, J., Rodriguez, C., Sifakis, J. and Voiron, J. \u201cVerification in XESAR of the Sliding Window Protocol.\u201d In Proceedings of the Seventh IFIP Symposium on Protocol Specification, Testing, and Verification, 1987, North-Holland.","key":"9_CR19"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/BFb0035794","volume-title":"Proceedings ICALP","author":"B.U. Steffen","year":"1989","unstructured":"Steffen, B.U. \u201cCharacteristic Formulae for CCS with Divergence.\u201d In Proceedings ICALP, Lecture Notes in Computer Science 372, pp. 723\u2013733. Springer-Verlag, Berlin, 1989."},{"unstructured":"Steffen, B.U., and Ing\u00f3lfsd\u00f3ttir, A. \u201cCharacteristic Formulae for CCS with Divergence.\u201d To appear in Theoretical Computer Science.","key":"9_CR21"},{"key":"9_CR22","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, v. 49, 1987, pp. 311\u2013347.","journal-title":"Theoretical Computer Science"},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-50939-9_144","volume":"351","author":"C. Stirling","year":"1989","unstructured":"Stirling, C., and Walker, D. \u201cLocal Model Checking in the Modal Mu-Calculus.\u201d In Proceedings CAAP'89, Lecture Notes in Computer Science 351, pp. 369\u2013383, 1989.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Tarski, A. \u201cA Lattice-Theoretical Fixpoint Theorem and its Applications.\u201d Pacific Journal of Mathematics, v. 5, 1955.","key":"9_CR24","DOI":"10.2140\/pjm.1955.5.285"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1109\/LICS.1988.5117","volume-title":"Proceedings of the Third Annual Symposium on Logic in Computer Science","author":"D. Walker","year":"1988","unstructured":"Walker, D. \u201cBisimulations and Divergence.\u201d In Proceedings of the Third Annual Symposium on Logic in Computer Science, 1988, pp. 186\u2013192. Computer Society Press, Washington DC."},{"key":"9_CR26","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BFb0039079","volume":"458","author":"G. Winskel","year":"1990","unstructured":"Winskel, G. \u201cOn the Compositional Checking of Validity.\u201d In Proceedings CONCUR'90, Lecture Notes in Computer Science 458, pp. 481\u2013501, 1990.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_129.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:53:08Z","timestamp":1605628388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_129","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}