Abstract
Behavioural theories are a generalization of standard theories where the equality predicate is interpreted by an arbitrary (possibly partial) congruence relation, called behavioural equality. In this paper we first show how to reduce the behavioural theory of any class C of σ-algebras to (a subset of) the standard theory of some corresponding class of algebras. Then we consider infinitary axiomatizations of the behavioural equality and we define a general condition under which the infinitary axiomatization can be replaced by a finitary one. As a consequence, behavioural theorems over different kinds of specifications can be proved using standard proof techniques. All results are stated in an abstract way, i.e. independent of a particular behavioural equality. As an important example we can apply our results to observational theories where the behavioural equality is given by an observational equality between elements.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Bidoit and R. Hennicker. Proving behavioural theorems with standard first-order logic. In Proc. of ALP'94, pages 41–58. Springer-Verlag L.N.C.S. 850, 1994.
M. Bidoit, R. Hennicker, and M. Wirsing. Behavioural and abstractor specifications. Technical Report LIENS-94-10, 1994. A short version appeared as: Characterizing behavioural semantics and abstractor semantics, in Proc. of ESOP'94, Springer-Verlag L.N.C.S. 788, pages 105–119, 1994.
H. Ehrig and B. Mahr. Fundamentals of algebraic specification 1. Equations and initial semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.
J. Goguen and J. Meseguer. Universal realization, persistent interconnection and implementation of abstract modules. In Proc. of 9th ICALP, pages 265–281. Springer-Verlag L.N.C.S. 140, 1982.
R. Hennicker and M. Wirsing. Behavioural specifications. Proof and Computation, International Summer School Marktoberdorf 1993. Springer-Verlag, 1995.
M. Hofmann and D. Sannella. On behavioural abstraction and behavioural satisfaction in higher-order logic. In Proc. of TAPSOFT'95. Springer-Verlag L.N.C.S., 1995. To appear.
R. Milner. Fully abstract models of typed λ-calculi. Theoretical Computer Science, 4:1–22, 1977.
P. Nivela and F. Orejas. Initial behaviour semantics for algebraic specification. In Recent Trends in Data Type Specification, pages 184–207. Springer-Verlag L.N.C.S. 332, 1988.
H. Reichel. Initial restrictions of behaviour. In Proc. of IFIP Working Conference, The Role of Abstract Models in Information Processing, 1985.
D. Sannella and A. Tarlecki. Toward formal development of programs from algebraic specification: implementation revisited. Acta Informatica, 25:233–281, 1988.
O. Schoett. Behavioural correctness of data representation. Science of Computer Programming, 14:43–57, 1990.
M. Wirsing. Structured specifications: syntax, semantics and proof calculus. Logic and Algebra of Specification, International Summer School Marktoberdorf 1991. Springer-Verlag, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bidoit, M., Hennicker, R. (1995). Behavioural theories. In: Astesiano, E., Reggio, G., Tarlecki, A. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1994 1994. Lecture Notes in Computer Science, vol 906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014426
Download citation
DOI: https://doi.org/10.1007/BFb0014426
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59132-0
Online ISBN: 978-3-540-49198-9
eBook Packages: Springer Book Archive