We use the term simple refinement to describe refinements of operations (and collections of operations) where the state schema does not change. These rules apply to ADTs (as introduced in Chapter 1), and some even apply to “concrete” data types, which we will call repertoires.
KeywordsState Space Binary Relation State Schema League Table Concrete State
Unable to display preview. Download preview PDF.