BEZDĚK, Peter, Nikola BENEŠ, Vojtěch HAVEL, Jiří BARNAT and Ivana ČERNÁ. On Clock-Aware LTL Properties of Timed Automata. In Gabriel Ciobanu, Dominique Méry. Theoretical Aspects of Computing – ICTAC 2014. Neuveden: Springer International Publishing, 2014, p. 43-60. ISBN 978-3-319-10881-0. Available from: https://dx.doi.org/10.1007/978-3-319-10882-7_4.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name On Clock-Aware LTL Properties of Timed Automata
Authors BEZDĚK, Peter (703 Slovakia, belonging to the institution), Nikola BENEŠ (203 Czech Republic, guarantor, belonging to the institution), Vojtěch HAVEL (203 Czech Republic, belonging to the institution), Jiří BARNAT (203 Czech Republic, belonging to the institution) and Ivana ČERNÁ (203 Czech Republic, belonging to the institution).
Edition Neuveden, Theoretical Aspects of Computing – ICTAC 2014, p. 43-60, 18 pp. 2014.
Publisher Springer International Publishing
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/14:00076564
Organization unit Faculty of Informatics
ISBN 978-3-319-10881-0
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-10882-7_4
Keywords in English Linear Temporal Logic; Timed Automata; Automata-based Model Checking
Tags firank_B
Tags International impact, Reviewed
Changed by Changed by: prof. RNDr. Ivana Černá, CSc., učo 1419. Changed: 13/10/2020 09:25.
Abstract
We introduce the Clock-Aware Linear Temporal Logic (CA-LTL) for expressing linear time properties of timed automata, and show how to apply the standard automata-based approach of Vardi and Wolper to check for the validity of a CA-LTL formula over the continuous-time semantics of a timed automaton. Our model checking procedure employs zone-based abstraction and a new concept of the so called ultraregions. We also show that the Timed Büchi Automaton Emptiness problem is not the problem that the intended automata-based approach to CA-LTL model checking is reduced to. Finally, we give the necessary proofs of correctness, some hints for an efficient implementation, and preliminary experimental evaluation of our technique.
Links
EE2.3.30.0009, research and development projectName: Zaměstnáním čerstvých absolventů doktorského studia k vědecké excelenci
LH11065, research and development projectName: Řízení a ověřování vlastností komplexních hybridních systémů (Acronym: Řízení a ověřování vlastností komplexních hybridní)
Investor: Ministry of Education, Youth and Sports of the CR
MUNI/A/0855/2013, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace III. (Acronym: FI MAV III.)
Investor: Masaryk University, Category A
PrintDisplayed: 26/4/2024 07:09