Removing All Silent Transitions from Timed Automata

Authors:
Cătălin Dima;Ruggero Lanotte
Affiliations:
LACL, Université Paris 12, Créteil Cedex, France 94010;DSCPI, Università dell'Insubria, Como, Italy 22100
Venue:
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Year:
2009

Citing 10
Cited 0

A theory of timed automata

Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Timed automata with periodic clock constraints

Journal of Automata, Languages and Combinatorics
Computing Reachability Relations in Timed Automata

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Expressiveness of Updatable Timed Automata

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Partial Order Reductions for Timed Systems

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Timed Automata and the Theory of Real Numbers

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Are Timed Automata Updatable?

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Revisiting Digitization, Robustness, and Decidability for Timed Automata

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Undecidability Results for Timed Automata with Silent Transitions

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that all *** -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 *** -transitions.