Notes on the Parallel Decomposition Theory of Finite State Machines
Kahn Mason
Department of Computer Science
University of Canterbury
Abstract
This thesis applies the standard Hartmanis-Stearns decomposition theory to timed automata. Suitable partitions of states and clocks are required to generate quotient machines. An appropriate notion of orthogonal partitions is also defined.