@inproceedings{b4d6ea811f5a43a199a4168e7058d4da,
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 = "Taankvist, {Jakob Haahr} and Jiri Srba and Larsen, {Kim Guldstrand} and S{\o}rensen, {Mathias Grund} and Jensen, {Peter Gj{\o}l}",
year = "2014",
doi = "10.1007/978-3-319-06200-6_26",
language = "English",
isbn = "978-3-319-06199-3",
volume = "8430",
series = "Lecture Notes in Computer Science",
publisher = "Springer Publishing Company",
pages = "307--312",
editor = "Badger, {Julia M. } and Rozier, {Kristin Yvonne}",
booktitle = "NASA Formal Methods",
address = "United States",
note = "NASA Formal Methods ; Conference date: 29-04-2014 Through 01-05-2014",
}