Time-Darts: A Data Structure for Verification of Closed Timed Automata
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 ha...
Uložené v:
| Vydané v: | arXiv.org |
|---|---|
| Hlavní autori: | , , |
| Médium: | Paper |
| Jazyk: | English |
| Vydavateľské údaje: |
Ithaca
Cornell University Library, arXiv.org
27.11.2012
|
| Predmet: | |
| ISSN: | 2331-8422 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | 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 on time-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. The main conclusion is that in all our experiments the time-dart method outperforms the complete discretization and it scales significantly better for models with larger constants. |
|---|---|
| AbstractList | 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 on time-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. The main conclusion is that in all our experiments the time-dart method outperforms the complete discretization and it scales significantly better for models with larger constants. |
| Author | Larsen, Kim G Srba, Jiří Jørgensen, Kenneth Y |
| Author_xml | – sequence: 1 givenname: Kenneth surname: Jørgensen middlename: Y fullname: Jørgensen, Kenneth Y – sequence: 2 givenname: Kim surname: Larsen middlename: G fullname: Larsen, Kim G – sequence: 3 givenname: Jiří surname: Srba fullname: Srba, Jiří |
| BookMark | eNotjc1LwzAchoMoOOfuHgOeW_PLd7yVzqkw2GHF60ibFDq2RpNU_POtzNN7eZ_nuUPXYxg9Qg9ASq6FIE82_gzfJVCAUoIRV2hBGYNCc0pv0SqlIyGESkWFYAu0aYazL9Y25vSMK7y22eJ9jlOXp-hxHyL-8HHoh87mIYw49Lg-heQd_uMcrqYczjNzj256e0p-9b9L1Gxemvqt2O5e3-tqW1gBUDhrmHB8zreMA20JA2OU0OBYR6RT3mqiDFH9fCBKt0CtUZx5ZTXnBjq2RI8X7WcMX5NP-XAMUxzn4oESLaUEzoH9Aut_S-s |
| ContentType | Paper |
| Copyright | 2012. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2012. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.1211.6195 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a511-da935d4002b3412b031997581d3c06d7ea807907f02b078b12a9743e7a84491c3 |
| IEDL.DBID | M7S |
| IngestDate | Mon Jun 30 09:27:44 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a511-da935d4002b3412b031997581d3c06d7ea807907f02b078b12a9743e7a84491c3 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2086661441?pq-origsite=%requestingapplication% |
| PQID | 2086661441 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2086661441 |
| PublicationCentury | 2000 |
| PublicationDate | 20121127 |
| PublicationDateYYYYMMDD | 2012-11-27 |
| PublicationDate_xml | – month: 11 year: 2012 text: 20121127 day: 27 |
| PublicationDecade | 2010 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2012 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.497064 |
| SecondaryResourceType | preprint |
| Snippet | Symbolic data structures for model checking timed systems have been subject to a significant research, with Difference Bound Matrices (DBMs) still being the... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Algorithms Clocks Complexity Data structures Discretization |
| Title | Time-Darts: A Data Structure for Verification of Closed Timed Automata |
| URI | https://www.proquest.com/docview/2086661441 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA7aKnjyjY9acvAabbLZZteL1D5Q0LLYIvVU8oSCdGu3Lf58J3GrB8GLx33BMpnMfN9kHghdaqUodw1DNGBxwg1lRLpYELivdSRt6uJQKPwo-v1kNEqzMuBWlGmVa5sYDLXJtY-RA0lPmt6XcHo7eyd-apQ_XS1HaGyiqu-SQEPq3uA7xsKaAhBz9HU6GVp3Xcv5x2TlWyrQK6AO8S8LHNxKb_e_P7SHqpmc2fk-2rDTA7Qd0jl1cYh6vrKDdEAtihvcwh25kHgQOsUu5xYDTsUvoHmujNfh3OH2W15Yg_13BreWixyQrDxCw1532L4n5cQEIgE4ESPTKDawK5kC58SUr1BKgRBQE-lG0wgrk4YANuzgBYAGijIJdCKyQiacp1RHx6gyzaf2BOHUwF6OJWeWp1xwJZmJEqWtck5Lpvkpqq2lMi61vhj_iOTs78fnaAeAB_M1fUzUUAUEYC_Qll4tJsW8jqp33X72XA-LCVfZw1P2-gmip6lw |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3dT8IwEL8gavTJ7_iB2gd9rLKuY5uJMQQkEJCQQAxvS9d2CYlhuAHqH-X_6HUwfTDxjQdf121pe9e7313vA-BKhqHFo7KiErE45cpiVESOS_G5lLbQfuRkicIdt9v1hkO_V4DPPBfGhFXmMjET1CqWxkeORrpXMbqEWw-TV2q6Rpnb1byFxoIt2vrjDU229L5VR_peM9Z4HNSadNlVgAoEF1QJ33YUci4LUYCz0GTx-AiaLWXLckW5WnhlFy3GCF9A9RlaTCDktrUrPM59S9r42zVYx3kwP4sU7H-7dFjFRYBuLy5Ds0phtyJ5H81NBQfrBi0V55fAz7RYY-efrX8X1ntiopM9KOjxPmxmwaoyPYCGyVuhdWT69I5USV1MBelndXBniSaIwskznqto6Y0kcURqL3GqFTHfKVKdTWPE6eIQBquY-REUx_FYHwPxFUoqR3Cmuc9dHgqmbC-UOowiKZjkJ1DKiRAsz3Qa_FDg9O_hS9hqDp46QafVbZ_BNkIsZrIXmVuCIm6GPocNOZ-O0uQi4x8CwYrp9QVlmf0_ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Time-Darts%3A+A+Data+Structure+for+Verification+of+Closed+Timed+Automata&rft.jtitle=arXiv.org&rft.au=J%C3%B8rgensen%2C+Kenneth+Y&rft.au=Larsen%2C+Kim+G&rft.au=Srba%2C+Ji%C5%99%C3%AD&rft.date=2012-11-27&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1211.6195 |