Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems

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

3 Citationer (Scopus)
195 Downloads (Pure)

Abstrakt

Partial order reduction for timed systems is a challenging topic due to the dependencies among events induced by time acting as a global synchronization mechanism. So far, there has only been a limited success in finding practically applicable solutions yielding significant state space reductions. We suggest a working and efficient method to facilitate stubborn set reduction for timed systems with urgent behaviour. We first describe the framework in the general setting of timed labelled transition systems and then instantiate it to the case of timed-arc Petri nets. The basic idea is that we can employ classical untimed partial order reduction techniques as long as urgent behaviour is enforced. Our solution is implemented in the model checker TAPAAL and the feature is now broadly available to the users of the tool. By a series of larger case studies, we document the benefits of our method and its applicability to real-world scenarios.
OriginalsprogEngelsk
TitelInternational Conference on Computer Aided Verification : CAV 2018: Computer Aided Verification
ForlagSpringer
Publikationsdato18 jul. 2018
Sider527-546
ISBN (Trykt)978-3-319-96144-6
ISBN (Elektronisk)978-3-319-96145-3
DOI
StatusUdgivet - 18 jul. 2018
BegivenhedInternational Conference on Computer Aided Verification - Oxford, Storbritannien
Varighed: 14 jul. 201817 jul. 2018

Konference

KonferenceInternational Conference on Computer Aided Verification
LandStorbritannien
ByOxford
Periode14/07/201817/07/2018
NavnLecture Notes in Computer Science
Vol/bind10981
ISSN0302-9743

Citationsformater