@inproceedings{10.1007/978-3-642-04368-0_11,
Abstract = {We show that all $\epsilon$-transitions can be removed from timed automata if we allow transitions to be labeled with periodic clock constraints and with periodic clock updates. This utilizes a representation of the reachability relation in timed automata in a generalization of Difference Logic with periodic constraints. We also show that periodic updates are necessary for the removal of $\epsilon$-transitions.},
Address = {Berlin, Heidelberg},
Author = {Dima, C{\u{a}}t{\u{a}}lin and Lanotte, Ruggero},
BookTitle = {Formal Modeling and Analysis of Timed Systems},
Editor = {Ouaknine, Jo{\"e}l and Vaandrager, Frits W.},
File = {Dima-Lanotte2009\_Chapter\_RemovingAllSilentTransitionsFr (0) - a - a - n.pdf},
ISBN = {978-3-642-04368-0},
Keywords = {readme},
Pages = {118--132},
Publisher = {Springer Berlin Heidelberg},
Title = {Removing All Silent Transitions from Timed Automata},
Year = {2009},
date-added = {2018-07-25 17:10:56 +0000},
date-modified = {2018-07-25 20:33:00 +0000},
doi = {10.1007/978-3-642-04368-0_11}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A