Output details
11 - Computer Science and Informatics
University of Oxford
Return to search
Output 0 of 0 in the submission
Output title
Alternating Timed Automata over Bounded Time
Type
E - Conference contribution
Name of conference/published proceedings
25TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2010)
Volume number
-
Issue number
-
First page of article
60
ISSN of proceedings
1043-6871
Year of publication
2010
Number of additional authors
4
Additional information
<11>
This paper caps and unifies two long-running, distinct research threads in the real-time verification community, by defining a class of timed languages extending Alur-Dill timed regular languages that are closed under all Boolean operations, and moreover are "fully decidable" (in the sense of Henzinger) over bounded time, i.e., have decidable emptiness and language inclusion problems over finite time intervals. A key ingredient is to establish the decidability of a class of parametric McNaughton games that are played over timed words and that have winning conditions expressed in the monadic logic of order augmented with the distance-one relation.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
4
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
