Abstract
We investigate regular algebras, admitting infinitary regular terms interpreted as least upper bounds of suitable approximation chains. We prove that finitary observable contexts are suffcient for observational indistinguishability in a regular algebra. Moreover, assumed all observable sorts to be essentially flat, observational equivalence is also completely characterized by finitary contexts. As a corollary, methods of proving behavioural properties and observational equivalence of standard algebras can be reused in the setting of regular algebras.
The work reported here was partially supported by the KBN grant 8 T11C 019 19.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Bidoit, R. Hennicker: Behavioural theories and the proof of behavioural properties. Theoretical Computer Science 165(1): 3–55, 1996. 403, 406
M. Bidoit, A. Tarlecki: Regular algebras: a framework for observational specifications with recursive definitions. Report LIENS-95-12, ENS, 1995. 402, 404
I. Guessarian, F. Parisi-Presicce: Iterative vs. regular factor algebras. SIGACT News 15(2), 32–44, 1983. 402
R. Hennicker: Context induction: A proof principle for behavioural abstractions and algebraic implementations. Formal Aspects of Computing, 3(4):326–345, 1991. 403, 406
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
S. Lasota: Behavioural constructor implementation for regular algebras. To appear in Proc. 7 th International Conference on Logic for Programming and Automated Reasoning LPAR’2000, Springer-Verlag LNAI series. 403
D. Sannella, A. Tarlecki: Towards formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25:233–281, 1988. 402
D. Sannella, A. Tarlecki: Essential Concepts of Algebraic Specification and Program Development. Formal Aspects of Computing 9:229–269, 1997. 402, 403
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
A. Tarlecki, M. Wirsing: Continuous abstract data types. Fundamenta Informaticae 9(1986), 95–126. 402
J. Tiuryn: Fixed-points and algebras with infinitely long expressions. Part I. Regular algebras. Fundamenta Informaticae 2(1978), 102–128. 402
J. Tiuryn: Fixed-points and algebras with infinitely long expressions. Part II. Muclones of regular algebras. Fundamenta Informaticae 2(1979), 317–336. 402
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lasota, S. (2000). Finitary Observations in Regular Algebras. In: Hlaváč, V., Jeffery, K.G., Wiedermann, J. (eds) SOFSEM 2000: Theory and Practice of Informatics. SOFSEM 2000. Lecture Notes in Computer Science, vol 1963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44411-4_29
Download citation
DOI: https://doi.org/10.1007/3-540-44411-4_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41348-6
Online ISBN: 978-3-540-44411-4
eBook Packages: Springer Book Archive