{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:42:38Z","timestamp":1725496958416},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418641"},{"type":"electronic","value":"9783540453154"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_5","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:28:39Z","timestamp":1196663319000},"page":"72-87","source":"Crossref","is-referenced-by-count":5,"title":["On the Duality between Observability and Reachability"],"prefix":"10.1007","author":[{"given":"Michel","family":"Bidoit","sequence":"first","affiliation":[]},{"given":"Rolf","family":"Hennicker","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Kurz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"5_CR1","unstructured":"J. Ad\u00e1mek, H. Herrlich, and G. Strecker. Abstract and Concrete Categories. John Wiley & Sons, 1990."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0022-4049(75)90028-6","volume":"6","author":"M.A. Arbib","year":"1975","unstructured":"M.A. Arbib and E.G. Manes. Adjoint machines, state-behaviour machines, and duality. Journ. of Pure and Applied Algebra, 6:313\u2013344, 1975.","journal-title":"Journ. of Pure and Applied Algebra"},{"key":"5_CR3","unstructured":"M. Bidoit and R. Hennicker. Observer complete definitions are behaviourally coherent. In OBJ\/CafeOBJ\/Maude at Formal Methods\u2019 99, pages 83\u201394. THETA, 1999."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6423(95)00014-3","volume":"25","author":"M. Bidoit","year":"1995","unstructured":"M. Bidoit, R. Hennicker, and M. Wirsing. Behavioural and abstractor specifications. Science of Computer Programming, 25:149\u2013186, 1995.","journal-title":"Science of Computer Programming"},{"issue":"1","key":"5_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"J. Goguen","year":"1992","unstructured":"J. Goguen and R. Burstall. Institutions: abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39 (1):95\u2013146, 1992.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1007\/3-540-48118-4_40","volume-title":"Formal Methods (FM\u201999)","author":"J. Goguen","year":"1999","unstructured":"J. Goguen and G. Ro\u015fu. Hiding more of hidden algebra. In J.M. Wing, J. Woodcock, and J. Davies, editors, Formal Methods (FM\u201999), volume 1709 of LNCS, pages 1704\u20131719. Springer, 1999."},{"key":"5_CR7","unstructured":"R. Hennicker and M. Bidoit. Observational logic. In Armando Haeberer, editor, Algebraic Methodology and Software Technology (AMAST\u201998), volume 1548 of LNCS. Springer, 1999."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"R. Hennicker and A. Kurz. (\u03a9,\u039e)-logic: On the algebraic extension of coalgebraic specifications. In B. Jacobs and J. Rutten, editors, Coalgebraic Methods in Computer Science (CMCS\u201999), volume 19 of Electronic Notes in Theoretical Computer Science, pages 195\u2013211, 1999.","DOI":"10.1016\/S1571-0661(05)80275-0"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C.A.R. Hoare","year":"1972","unstructured":"C.A.R. Hoare. Proofs of correctness of data representations. Acta Informatica, 1:271\u2013281, 1972.","journal-title":"Acta Informatica"},{"key":"5_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-59293-8_199","volume-title":"TAPSOFT\u2019 95","author":"M. Hofmann","year":"1995","unstructured":"M. Hofmann and D.T. Sannella. On behavioural abstraction and behavioural satisfaction in higher-order logic. In TAPSOFT\u2019 95, volume 915 of LNCS, pages 247\u2013261. Springer, 1995."},{"key":"5_CR11","unstructured":"B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. EATCS Bulletin, 62, 1997."},{"key":"5_CR12","unstructured":"R. E. Kalman, P. L. Falb, and M. A. Arbib. Topics in Mathematical System Theory. McGraw-Hill, 1969."},{"key":"5_CR13","unstructured":"J. Loeckx, H.-D. Ehrich, and M. Wolf. Specification of Abstract Data Types. Wiley and Teubner, 1996."},{"key":"5_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/3-540-61629-2_53","volume-title":"Recent Trends in Data Type Specification","author":"G. Malcolm","year":"1996","unstructured":"Grant Malcolm. Behavioural equivalence, bisimulation, and minimal realisation. In M. Haveraaen, O. Owe, and O.-J. Dahl, editors, Recent Trends in Data Type Specification, volume 1130 of LNCS, pages 359\u2013378. Springer, 1996."},{"key":"5_CR15","unstructured":"CoFI Task Group on Language Design. Casl-the cofi algebraic specification language-summary. http:\/\/www.brics.dk\/Projects\/CoFI\/Documents\/CASL\/Summary\/ ."},{"key":"5_CR16","doi-asserted-by":"crossref","DOI":"10.1515\/9783112573426","volume-title":"Initial computability, algebraic specifications, and partial algebras","author":"H. Reichel","year":"1987","unstructured":"Horst Reichel. Initial computability, algebraic specifications, and partial algebras. Oxford, Clarendon Press, 1987."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(87)90023-7","volume":"34","author":"D.T. Sannella","year":"1987","unstructured":"D.T. Sannella and A. Tarlecki. On observational equivalence and algebraic specification. Journal Comput. System Sci., 34:150\u2013178, 1987.","journal-title":"Journal Comput. System Sci."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0890-5401(88)90008-9","volume":"76","author":"D.T. Sannella","year":"1988","unstructured":"D.T. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76:165\u2013210, 1988.","journal-title":"Information and Computation"},{"key":"5_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-50939-9_124","volume-title":"TAPSOFT\u2019 89","author":"M. Wirsing","year":"1989","unstructured":"M. Wirsing and M. Broy. A modular framework for specification and information. In F. Orejas J. Diaz, editor, TAPSOFT\u2019 89, volume 351 of LNCS, pages 42\u201373. Springer, 1989."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T02:57:55Z","timestamp":1684119475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}