Automatic verification of the timing properties of MMT automata

This thesis represents the first use of the Larch tools to verify the timing properties of distributed algorithms, as specified by MMT automata. It shows general methods to formalize and verify automata and timed forward simulations. Additionally, it describes a set of libraries to aid the axiomization of MMT automata and simulation relationships. It includes a sample verified forward simulation relationship. Finally, it details the difficulties that will face future users, and offers some solutions. Thesis Supervisor: Nancy A. Lynch Title: Professor Thesis Supervisor: Stephen J. Garland Title: Principal Research Scientist