JUCS - Journal of Universal Computer Science 5(9): 574-587, doi: 10.3217/jucs-005-09-0574
Decomposition of Timed Automata
expand article infoKahn Mason‡, Padmanabhan Krishnan§
‡ Engineering-Economic Systems and Operations Research, Stanford University, Stanford University, United States of America§ Department of Computer Science, University of Canterbury, New Zealand

Corresponding author: Kahn Mason ( kmason@leland.stanford.edu )

© Kahn Mason, Padmanabhan Krishnan.
This article is freely available under the J.UCS Open Content License.
Citation: Mason K, Krishnan P (1999) Decomposition of Timed Automata. JUCS - Journal of Universal Computer Science 5(9): 574-587. https://doi.org/10.3217/jucs-005-09-0574
Open Access
Abstract
In this paper we extend the notion of homomorphisms and decomposition to timed automata. This is based on the classical Hartmanis-Stearns decomposition results for finite state automata. As in the classical theory, the existence of non-trivial orthogonal partitions is both necessary and sufficient for non-trivial decompositions. Of course, now these partitions have to include both the set of states and the set of timers (or clocks) in the system. We present an example which illustrate the various issues.
Keywords
timed automata, parallel decomposition, state and clock partition