Using Mappings to Prove Timing Properties
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE
Pagination or Media Count:
A new technique for proving timing properties for timing-based algorithms is described it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automaton whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multivalued mapping from the assumptions automation to the requirements automation is then used to show that the given system satisfies the requirements. The technique is illustrated with two simple examples, a resource manager and a signal relay. The technique is shown to be complete, that is, if some automaton with certain timing assumptions has certain timing behavior, the there exists a mapping from the assumptions automation to the requirements automation.
- Computer Programming and Software