585 search results - page 5 / 117 » Better Abstractions for Timed Automata |
FUIN
2008
13 years 8 months ago
2008
Abstract. Communicating Hierarchical Transaction-based Timed Automata have been introduced to model systems performing long
ICTAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
FMSD
2008
13 years 8 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
CONCUR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...