Download now Free registration required
The authors need to think about reachability. It seems to one that the counterexample given in the chapter relies exactly on having a simulation that is not well-defined, in the sense that it does not "Deal" with all reachable states (made clearer soon!). An ADT may never be able to reach some of its states because there is no sequence of operations, starting with the initialisation, which allows one to pass to those states. This also means they have to think of all the operations in an ADT, including the initialisation and finalisation operations, since reachability is a property of the whole ADT, not of single operations within an ADT.
- Format: PDF
- Size: 84.09 KB