{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:47:40Z","timestamp":1725486460722},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413486"},{"type":"electronic","value":"9783540444114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44411-4_29","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:52:31Z","timestamp":1182207151000},"page":"402-410","source":"Crossref","is-referenced-by-count":0,"title":["Finitary Observations in Regular Algebras"],"prefix":"10.1007","author":[{"given":"Slawomir","family":"Lasota","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,22]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(96)00039-4","volume":"165","author":"M. Bidoit","year":"1996","unstructured":"M. Bidoit, R. Hennicker: Behavioural theories and the proof of behavioural properties. Theoretical Computer Science 165(1): 3\u201355, 1996. 403, 406","journal-title":"Theoretical Computer Science"},{"key":"29_CR2","unstructured":"M. Bidoit, A. Tarlecki: Regular algebras: a framework for observational specifications with recursive definitions. Report LIENS-95-12, ENS, 1995. 402, 404"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/1008923.1008924","volume":"15","author":"I. Guessarian","year":"1983","unstructured":"I. Guessarian, F. Parisi-Presicce: Iterative vs. regular factor algebras. SIGACT News 15(2), 32\u201344, 1983. 402","journal-title":"SIGACT News"},{"issue":"4","key":"29_CR4","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/BF01642507","volume":"3","author":"R. Hennicker","year":"1991","unstructured":"R. Hennicker: Context induction: A proof principle for behavioural abstractions and algebraic implementations. Formal Aspects of Computing, 3(4):326\u2013345, 1991. 403, 406","journal-title":"Formal Aspects of Computing"},{"key":"29_CR5","unstructured":"S. Lasota: Algebraic observational equivalence and open-maps bisimilarity. Ph.D. Thesis in Institute of Informatics of Warsaw University, March 2000. Accessible at http:\/\/www.mimuw.edu.pl\/sl\/work\/phd.ps.gz . 403, 404, 405, 407"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"S. Lasota: Behavioural constructor implementation for regular algebras. To appear in Proc. 7 th International Conference on Logic for Programming and Automated Reasoning LPAR\u20192000, Springer-Verlag LNAI series. 403","DOI":"10.1007\/3-540-44404-1_5"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02737104","volume":"25","author":"D. Sannella","year":"1988","unstructured":"D. Sannella, A. Tarlecki: Towards formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25:233\u2013281, 1988. 402","journal-title":"Acta Informatica"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01211084","volume":"9","author":"D. Sannella","year":"1997","unstructured":"D. Sannella, A. Tarlecki: Essential Concepts of Algebraic Specification and Program Development. Formal Aspects of Computing 9:229\u2013269, 1997. 402, 403","journal-title":"Formal Aspects of Computing"},{"key":"29_CR9","unstructured":"O. Schoett: Data abstraction and correctness of modular programming. Ph.D. thesis, CST-42-87, Department of Computer Science, University of Edinburgh, 1987. 403, 407, 409"},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.3233\/FI-1986-9106","volume":"9","author":"A. Tarlecki","year":"1986","unstructured":"A. Tarlecki, M. Wirsing: Continuous abstract data types. Fundamenta Informaticae 9(1986), 95\u2013126. 402","journal-title":"Fundamenta Informaticae"},{"key":"29_CR11","first-page":"102","volume":"2","author":"J. Tiuryn","year":"1978","unstructured":"J. Tiuryn: Fixed-points and algebras with infinitely long expressions. Part I. Regular algebras. Fundamenta Informaticae 2(1978), 102\u2013128. 402","journal-title":"Fundamenta Informaticae"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.3233\/FI-1978-2120","volume":"2","author":"J. Tiuryn","year":"1979","unstructured":"J. Tiuryn: Fixed-points and algebras with infinitely long expressions. Part II. Muclones of regular algebras. Fundamenta Informaticae 2(1979), 317\u2013336. 402","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2000: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44411-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T03:10:51Z","timestamp":1628997051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44411-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413486","9783540444114"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44411-4_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}