Abstract
The predicate transformers that we use to model contracts are constructed from other predicate transformers or from simpler elements, like state predicates, state transformers, or state relations. The predicate transformer constructors can thus be seen as functions that map elements in one domain to the domain itself or to another domain. The basic question that we investigate in this chapter is to what extent the lattice and category structure is preserved by these constructors, i.e., to what extent the constructors are monotonic and homomorphic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Back, RJ., von Wright, J. (1998). The Refinement Calculus Hierarchy. In: Refinement Calculus. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1674-2_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1674-2_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98417-9
Online ISBN: 978-1-4612-1674-2
eBook Packages: Springer Book Archive