Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-01-08
Computer Science
Formal Languages and Automata Theory
submitted to LATA 2010
Scientific paper
In this paper, we propose a procedure that given an integer reset timed automaton (IRTA) ${\cal A}$, produces a language equivalent deterministic one clock IRTA ${\cal B}$ whose size is at most doubly exponential in the size of ${\cal A}$. We prove that this bound on the number of locations is tight. Further, if integer resets are used in stopwatch automata, a subclass of stopwatch automata which is closed under all boolean operations and for which reachability is decidable is obtained.
Krishna. S.
Manasa Lakshmi
No associations
LandOfFree
Integer Reset Timed Automata: Clock Reduction and Determinizability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Integer Reset Timed Automata: Clock Reduction and Determinizability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Integer Reset Timed Automata: Clock Reduction and Determinizability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-501982