{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:47:41Z","timestamp":1742957261361,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205371"},{"type":"electronic","value":"9783540400202"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40020-2_18","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T18:42:34Z","timestamp":1277318554000},"page":"312-327","source":"Crossref","is-referenced-by-count":0,"title":["Notions of Behaviour and Reachable-Part and Their Institutions"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kurz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0005-1098(74)90039-9","volume":"10","author":"M.A. Arbib","year":"1974","unstructured":"Arbib, M.A., Manes, E.G.: Foundations of system theory: decomposable systems. Automatica\u00a010, 285\u2013302 (1974)","journal-title":"Automatica"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0022-4049(75)90028-6","volume":"6","author":"M.A. Arbib","year":"1975","unstructured":"Arbib, M.A., Manes, E.G.: Adjoint machines, state-behaviour machines, and duality. Journ. of Pure and Applied Algebra\u00a06, 313\u2013344 (1975)","journal-title":"Journ. of Pure and Applied Algebra"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-45931-6_3","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Bidoit","year":"2002","unstructured":"Bidoit, M., Hennicker, R.: On the integration of observability and reachability concepts. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 21\u201336. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Bidoit, M., Hennicker, R., Kurz, A.: Observational logic, constructor-based logic, and their duality. Theoretical Computer Science (to appear);","key":"#cr-split#-18_CR5.1","DOI":"10.1016\/S0304-3975(02)00865-4"},{"unstructured":"Extended version of [6]. Available as CWI Technical Report SEN-R0223 (2002)","key":"#cr-split#-18_CR5.2"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-45315-6_5","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Bidoit","year":"2001","unstructured":"Bidoit, M., Hennicker, R., Kurz, A.: On the duality between observability and reachability. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 72\u201387. Springer, Heidelberg (2001)"},{"key":"18_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525872","volume-title":"Handbook of Categorical Algebra","author":"F. Borceux","year":"1994","unstructured":"Borceux, F.: Handbook of Categorical Algebra. Cambridge University Press, Cambridge (1994)"},{"doi-asserted-by":"crossref","unstructured":"C\u00eerstea, C.: Institutionalising many-sorted coalgebraic modal logic. In: Moss, L.S. (ed.) Coalgebraic Methods in Computer Science (CMCS 2002). ENTCS, vol.\u00a065(1) (2002)","key":"18_CR8","DOI":"10.1016\/S1571-0661(04)80359-1"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45931-6_7","volume-title":"Foundations of Software Science and Computation Structures","author":"C. C\u00eerstea","year":"2002","unstructured":"C\u00eerstea, C.: On specification logics for algebra-coalgebra structures: Reconciling reachability and observability. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 82\u201397. Springer, Heidelberg (2002)"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"J. Goguen","year":"1992","unstructured":"Goguen, J., Burstall, R.: Institutions: abstract model theory for specification and programming. Journal of the ACM\u00a039(1), 95\u2013146 (1992)","journal-title":"Journal of the ACM"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01843493","volume":"6","author":"J. Goguen","year":"1973","unstructured":"Goguen, J.: Realisation is universal. Mathematical System Theory\u00a06(4), 359\u2013374 (1973)","journal-title":"Mathematical System Theory"},{"key":"18_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0061280","volume-title":"Formal category theory: adjointness for 2-categories","author":"J.W. Gray","year":"1974","unstructured":"Gray, J.W.: Formal category theory: adjointness for 2-categories. Lecture Notes in Mathematics, vol.\u00a0391. Springer, Heidelberg (1974)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-49253-4_20","volume-title":"Algebraic Methodology and Software Technology","author":"R. Hennicker","year":"1998","unstructured":"Hennicker, R., Bidoit, M.: Observational logic. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol.\u00a01548, p. 263. Springer, Heidelberg (1998)"},{"key":"18_CR14","volume-title":"Categorical Logic and Type Theory","author":"B. Jacobs","year":"1998","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Elsevier, Amsterdam (1998)"},{"key":"18_CR15","volume-title":"Topics i n Mathematical System Theory","author":"R.E. Kalman","year":"1969","unstructured":"Kalman, R.E., Falb, P.L., Arbib, M.A.: Topics i n Mathematical System Theory. McGraw-Hill, New York (1969)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(01)00021-4","volume":"280","author":"A. Kurz","year":"2002","unstructured":"Kurz, A., Hennicker, R.: On institutions for modular coalgebraic specifications. Theoretical Computer Science\u00a0280, 69\u2013103 (2002)","journal-title":"Theoretical Computer Science"},{"unstructured":"Kurz, A., Pattinson, D.: Coalgebras and modal logics for parameterised endofunctors. Technical Report SEN-R0040, CWI (2000)","key":"18_CR17"},{"doi-asserted-by":"crossref","unstructured":"Kurz, A., Pattinson, D.: Notes on coalgebras, co-fibrations and concurrency. In: Reichel, H. (ed.) Coalgebraic Methods in Computer Science (CMCS 2000). ENTCS, vol.\u00a033, pp. 199\u2013233 (2000)","key":"18_CR18","DOI":"10.1016\/S1571-0661(05)80349-4"},{"key":"18_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Category Theory for the Working Mathematician","author":"S.M. Lane","year":"1971","unstructured":"Lane, S.M.: Category Theory for the Working Mathematician. Springer, Heidelberg (1971)"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0055624","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J.J.M.M. Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Automata and coinduction - an exercise in coalgebra. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 194\u2013218. Springer, Heidelberg (1998)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: A theory of systems. Theoretical Computer Science\u00a0249, 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"unstructured":"Streicher, T.: Fibred categories \u00e1 la J. B\u00e9nabou (1999), http:\/\/www.mathematik.tu-darmstadt.de\/~streicher\/FIBR\/fib.ps.gz","key":"18_CR22"},{"key":"18_CR23","series-title":"ch. 4","volume-title":"Algebraic Foundations of Systems Specification","author":"A. Tarlecki","year":"1999","unstructured":"Tarlecki, A.: Institutions: An abstract framework for formal specifications. In: Astesiano, E., Kreowski, H.-J., Krieg-Br\u00fcckner, B. (eds.) Algebraic Foundations of Systems Specification. ch. 4. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40020-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T06:54:38Z","timestamp":1559199278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40020-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205371","9783540400202"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40020-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}