{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:03Z","timestamp":1725664983883},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642992"},{"type":"electronic","value":"9783540697190"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-64299-4_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:36:22Z","timestamp":1330299382000},"page":"285-299","source":"Crossref","is-referenced-by-count":3,"title":["Open maps as a bridge between algebraic observational equivalence and bisimilarity"],"prefix":"10.1007","author":[{"given":"S\u0142awomir","family":"Lasota","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky, C.-H. Luke Ong. Full Abstraction in the Lazy Lambda Calculus. Information and Computation 105(2), 159\u2013267, 1993.","journal-title":"Information and Computation"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Bidoit, M., Hennicker, R., Wirsing, M. Behavioural and abstractor specifications. Science of Computer Programming 25 (2\u20133), 1995.","DOI":"10.1016\/0167-6423(95)00014-3"},{"key":"16_CR3","unstructured":"Bidoit, M., Tarlecki, A. Regular algebras: a framework for observational specifications with recursive definitions. Report LIENS-95-12, Ecole Normale Superieure, 1995."},{"key":"16_CR4","unstructured":"Bidoit, M., Tarlecki A. Behavioural satisfaction and equivalence in concrete model categories. Manuscript. The short version appeared in Proc. 20th Coll. on Trees in Algebra and Computing CAAP'96, Link\u00f6ping, Springer-Verlag."},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(70)80014-X","volume":"8","author":"G. Birkhoff","year":"1970","unstructured":"Birkhoff, G., Lipson, J.D. Heterogeneous algebras. J. Combinatorial Theory 8 (1970),115\u2013133.","journal-title":"J. Combinatorial Theory"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF00625280","volume":"18","author":"M. Broy","year":"1982","unstructured":"Broy, M., Wirsing, M. Partial abstract data types. Acta Informatica 18 (1982), 47\u201364.","journal-title":"Acta Informatica"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, A., Nielsen, M. Open maps (at) work. Research series RS-95-23, BRICS, Department of Computer Science, University of Aarhus, 1995.","DOI":"10.7146\/brics.v2i23.19925"},{"issue":"3","key":"16_CR8","first-page":"175","volume":"93","author":"Y. Diers","year":"1979","unstructured":"Diers, Y., Families universelles de morphismes. Annales de la Societe Scientifique de Bruxelles, 93, nr 3, 1979, 175\u2013195.","journal-title":"Annales de la Societe Scientifique de Bruxelles"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Giarratana, V., Gimona, F., Montanari, U. Observability concepts in abstract data type specification. Proc. 5th Intl. Symp. Mathematical Foundations of Computer Science, Gda\u0144sk 1976, LNCS 45, Springer-Verlag 1976, 576\u2013587.","DOI":"10.1007\/3-540-07854-1_231"},{"key":"16_CR10","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G. An initial algebra approach to the specification, correctness and implementation of abstract data types. Current Trends in Programming Methodology 4, Data Structuring, Yeh, R.T., ed., 80\u2013149, Prentice-Hall 1978."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Gordon, A. A tutorial on co-induction and functional programming. Proc. of the 1994 Glasgow Workshop on Functional Programming, Springer Workshops in Computing, 1995, 78\u201395.","DOI":"10.1007\/978-1-4471-3573-9_6"},{"key":"16_CR12","unstructured":"Jacobs, B.F.P. Objects and classes, coalgebraically. Technical Report CSR9536, CWI, 1995."},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0168-0072(94)90069-8","volume":"70","author":"A. Joyal","year":"1994","unstructured":"Joyal, A., Moerdijk, I. A completeness theorem for open maps. Annals of Pure and Applied Logic 70 (1994), 51\u201386.","journal-title":"Annals of Pure and Applied Logic"},{"key":"16_CR14","unstructured":"Joyal, A., Nielsen, G. Winskel, Bisimulation and open maps. Proc. 8th Annual Symposium on Logic in Computer Science LICS'93, 1993, 418\u2013427."},{"key":"16_CR15","unstructured":"Lasota, S. Open Maps as a Bridge between Algebraic Observational Equivalence and Bisimilarity. Technical report 97-12 (249), Institute of Informatics, Warsaw University. Accesible at http:\/\/zls.mimuw.edu.pl\/~sl."},{"key":"16_CR16","unstructured":"Lasota, S. Partial Congruence Factorization of Bisimilarity Induced by Open Maps. Manuscript, accesible at http:\/\/zls.mimuw.edu.pl\/~sl."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Malcolm, G. Behavioural equivalence, bisimilarity, and minimal realisation. Recent Trends in Data Type Specification, 11th Workshop on Specification of Abstract Data Types, Oslo, 1995. LNCS 1130, 359\u2013378.","DOI":"10.1007\/3-540-61629-2_53"},{"key":"16_CR18","unstructured":"Milner, R. Communication and concurrency. Prentice-Hall International Series in Computer Science, C. A. R. Hoare series editor, 1989."},{"key":"16_CR19","unstructured":"Morris, J. H. Lambda-Calculus Models of Programming Languages. Ph.D. thesis, MIT, 1968."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Park, D.M.R. Concurrency and Automata on Infinite Sequences. Proc. 5th G.I. Conference, Lecture Notes in Computer Science 104, Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"16_CR21","unstructured":"Reichel, H. Behavioural equivalence-a unifying concept for initial and final specification methods. Proc. 3rd Hungarian Computer Science Conference, Mathematical Models in Computer Systems, M. Arato, L. Varga, eds., Budapest, 27\u201339, 1981."},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(87)90023-7","volume":"34","author":"D. Sannella","year":"1987","unstructured":"Sannella, D., Tarlecki, A. On observational equivalence and algebraic specification. J. Computer and System Sciences 34 (1987), 150\u2013178.","journal-title":"J. Computer and System Sciences"},{"key":"16_CR23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.3233\/FI-1986-9106","volume":"9","author":"A. Tarlecki","year":"1986","unstructured":"Tarlecki, A., Wirsing, M. Continuous abstract data types. Fundamenta Informaticae 9 (1986), 95\u2013126.","journal-title":"Fundamenta Informaticae"},{"key":"16_CR24","first-page":"102","volume":"2","author":"J. Tiuryn","year":"1978","unstructured":"Tiuryn, J. Fixed-points and algebras with infinitely long expressions. Part l. Regular algebras. Fundamenta Informaticae 2 (1978), 102\u2013128.","journal-title":"Fundamenta Informaticae"}],"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\/3-540-64299-4_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:57:10Z","timestamp":1640951830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-64299-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642992","9783540697190"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-64299-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}