Time-Darts: A Data Structure for Verification of Closed Timed Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00062426" target="_blank" >RIV/00216224:14330/12:00062426 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4204/EPTCS.102.13" target="_blank" >http://dx.doi.org/10.4204/EPTCS.102.13</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4204/EPTCS.102.13" target="_blank" >10.4204/EPTCS.102.13</a>
Alternative languages
Result language
angličtina
Original language name
Time-Darts: A Data Structure for Verification of Closed Timed Automata
Original language description
Symbolic data structures for model checking timed systems have been subject to a significant research, with Difference Bound Matrices (DBMs) still being the preferred data structure in several mature verification tools. In comparison, discretization offers an easy alternative, with all operations having linear-time complexity in the number of clocks, and yet valid for a large class of closed systems. Unfortunately, fine-grained discretization causes itself a state-space explosion. We introduce a new data structure called time-darts for the symbolic representation of state-spaces of timed automata. Compared with the complete discretization, a single time-dart allows to represent an arbitrary large set of states, yet the time complexity of operations ontime-darts remain linear in the number of clocks. We prove the correctness of the suggested reachability algorithm and perform several experiments in order to compare the performance of time-darts and the complete discretization.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LA09016" target="_blank" >LA09016: Czech Republic membership in the European Research Consortium for Informatics and Mathematics (ERCIM)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Electronic Proceedings of Theoretical Computer Science
ISSN
2075-2180
e-ISSN
—
Volume of the periodical
102
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
15
Pages from-to
141-155
UT code for WoS article
—
EID of the result in the Scopus database
—