@inproceedings{efeea869edd04bf1b4f323d9904141cc,
title = "Memory efficient data structures for explicit verification of timed systems",
abstract = "Timed analysis of real-time systems can be performed using continuous (symbolic) or discrete (explicit) techniques. The explicit state-space exploration can be considerably faster for models with moderately small constants, however, at the expense of high memory consumption. In the setting of timed-arc Petri nets, we explore new data structures for lowering the used memory: PTries for efficient storing of configurations and time darts for semi-symbolic description of the state-space. Both methods are implemented as a part of the tool TAPAAL and the experiments document at least one order of magnitude of memory savings while preserving comparable verification times.",
author = "Jensen, {Peter Gj{\o}l} and Kim Larsen and Jiri Srba and S{\o}rensen, {Mathias Grund} and Taankvist, {Jakob Haar}",
year = "2014",
doi = "10.1007/978-3-319-06200-6_26",
language = "English",
isbn = "9783319061993",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "307--312",
editor = "Badger, {Julia M.} and Rozier, {Kristin Yvonne}",
booktitle = "NASA Formal Methods",
address = "United States",
}