{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:23:24Z","timestamp":1725459804260},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540530487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039057","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T14:58:08Z","timestamp":1138719488000},"page":"141-151","source":"Crossref","is-referenced-by-count":7,"title":["A preorder for partial process specifications"],"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","reference":[{"key":"12_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, v. 53, 1987, pp. 225\u2013241.","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","unstructured":"Cleaveland, R., J. Parrow and B.U. Steffen. \u201cA Semantics-Based Tool for the Verification of Finite-State Systems.\u201d In Proceedings of the Ninth IFIP Symposium on Protocol Specification, Testing and Verification, June 1989. To be published by North-Holland."},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland, R., J. Parrow and B.U. Steffen. \u201cThe Concurrency Workbench.\u201d In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, Lecture Notes in Computer Science 407. Springer-Verlag, Berlin, 1989."},{"key":"12_CR4","first-page":"108","volume-title":"When is \u2018Partial\u2019 Adequate? A Logic-Based Proof Technique for Partial Specifications","author":"R. Cleaveland","year":"1990","unstructured":"Cleaveland, R. and B. Steffen. \u201cWhen is \u2018Partial\u2019 Adequate? A Logic-Based Proof Technique for Partial Specifications.\u201d In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pp. 108\u2013117. Computer Society Press, Los Alamitos, 1990."},{"key":"12_CR5","unstructured":"Graf, S. and B. Steffen. \u201cUsing Interface Specifications for Compositional Reduction.\u201d To appear in Proceedings of the Workshop on Computer-Aided Verification."},{"key":"12_CR6","unstructured":"Larsen, K.G., and R. Milner. \u201cVerifying a Protocol Using Relativized Bisimulation.\u201d In Proceedings of ICALP 87, Lecture Notes in Computer Science 267. Springer-Verlag, Berlin."},{"key":"12_CR7","unstructured":"Larsen, K.G., and B. Thomsen. \u201cCompositional Proofs by Partial Specification of Processes.\u201d Technical Report 87-20, University of Aalborg, July 1987."},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/LICS.1988.5119","volume-title":"Proceedings of the Third Annual Symposium on Logic in Computer Science","author":"K.G. Larsen","year":"1988","unstructured":"Larsen, K.G. and B. Thomsen. \u201cA Modal Process Logic.\u201d In Proceedings of the Third Annual Symposium on Logic in Computer Science, pp. 203\u2013210. Computer Society Press, Washington DC, 1988."},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/LICS.1990.113738","volume-title":"Proceedings of the Fifth Annual Symposium on Logic in Computer Sicence","author":"K. Larsen","year":"1990","unstructured":"Larsen, K. and Xinxin, L. \u201cEquation Solving through an Operational Semantics of Context.\u201d In Proceedings of the Fifth Annual Symposium on Logic in Computer Sicence, pp. 108\u2013117. Computer Society Press, Los Alamitos, 1990."},{"key":"12_CR10","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."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-10828-9_52","volume-title":"A Modal Characterization of Observable Machine Behaviour","author":"R. Milner","year":"1981","unstructured":"Milner, R. \u201cA Modal Characterization of Observable Machine Behaviour.\u201d Lecture Notes in Computer Science 112, pp. 25\u201334. Springer-Verlag, Berlin, 1981."},{"key":"12_CR12","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R. Communication and Concurrency. Prentice-Hall, New York, 1989."},{"key":"12_CR13","unstructured":"Shurek, G. and O. Grumberg. \u201cThe Modular Framework of Computer-Aided Verification: Motivation, Solutions and Evaluation Criteria.\u201d To appear in Proceedings of the Workshop on Computer-Aided Verification."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Steffen, B.U. \u201cCharacteristic Formulae for CCS with Divergence.\u201d In Proceedings of Eleventh International Colloquium on Automata, Languages and Programming, 1989.","DOI":"10.1007\/BFb0035794"},{"key":"12_CR15","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":"12_CR16","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, pp. 186\u2013192. Computer Society Press, Washington DC, 1988."}],"container-title":["Lecture Notes in Computer Science","CONCUR '90 Theories of Concurrency: Unification and Extension"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039057.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:24:23Z","timestamp":1607552663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540530487"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0039057","relation":{},"subject":[]}}