Memory Efficient Data Structures for Explicit Verification of Timed Systems

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

7 Citationer (Scopus)

Abstrakt

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.
OriginalsprogEngelsk
TitelNASA Formal Methods
RedaktørerJulia M. Badger, Kristin Yvonne Rozier
Antal sider6
Vol/bind8430
ForlagSpringer Publishing Company
Publikationsdato2014
Sider307-312
ISBN (Trykt)978-3-319-06199-3
ISBN (Elektronisk)978-3-319-06200-6
DOI
StatusUdgivet - 2014
BegivenhedNASA Formal Methods - Houston, TX, USA
Varighed: 29 apr. 20141 maj 2014

Konference

KonferenceNASA Formal Methods
LandUSA
ByHouston, TX
Periode29/04/201401/05/2014
NavnLecture Notes in Computer Science
ISSN0302-9743

Citationsformater