DocumentCode
1958567
Title
Real-Time Model Checking: Algorithms and Complexity
Author
Worrell, James
Author_Institution
Comput. Lab., Oxford Univ., Oxford
fYear
2008
fDate
16-18 June 2008
Firstpage
19
Lastpage
19
Abstract
In this talk we describe a new automata-theoretic approach to model checking real-time systems. We show how this approach yields both upper and lower complexity bounds for various decision problems involving timed automata and temporal logics. To put these developments in context we survey some classical results concerning automata, temporal logic and monadic predicate logic over the reals.
Keywords
automata theory; computational complexity; formal specification; real-time systems; temporal logic; automata theory; complexity bound; decision problem; monadic predicate logic; real-time model checking; real-time systems; temporal logic; timed automata; Algorithm design and analysis; Automata; Clocks; Laboratories; Logic devices; Mathematics; Queueing analysis; Real time systems; Model Checking; Real-time; Temporal Logic;
fLanguage
English
Publisher
ieee
Conference_Titel
Temporal Representation and Reasoning, 2008. TIME '08. 15th International Symposium on
Conference_Location
Montreal, QC
ISSN
1530-1311
Print_ISBN
978-0-7695-3181-6
Type
conf
DOI
10.1109/TIME.2008.30
Filename
4553286
Link To Document