10 search results - page 1 / 2 » Timed Automata with Integer Resets: Language Inclusion and E... |
FORMATS
2008
Springer
13 years 5 months ago
2008
Springer
LATA
2009
Springer
13 years 11 months ago
2009
Springer
ICALP
2009
Springer
14 years 4 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...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
IANDC
2008
13 years 4 months ago
2008
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...