Simplification of CTL Formulae for Efficient Model Checking of Petri Nets

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

8 Citationer (Scopus)

Abstrakt

We study techniques to overcome the state space explosion problem in CTL model checking of Petri nets. Classical state space pruning approaches like partial order reductions and structural reductions become less efficient with the growing size of the CTL formula. The reason is that the more places and transitions are used as atomic propositions in a given formula, the more of the behaviour (interleaving) becomes relevant for the validity of the formula. We suggest several methods to reduce the size of CTL formulae, while preserving their validity. By these methods, we significantly increase the benefits of structural and partial order reductions, as the combination of our techniques can achive up to 60% average reduction in formulae sizes. The algorithms are implemented in the open-source verification tool TAPAAL and we document the efficiency of our approach on a large benchmark of Petri net models and queries from the Model Checking Contest 2017.
OriginalsprogEngelsk
TitelPETRI NETS 2018: Application and Theory of Petri Nets and Concurrency
Udgivelsessted978-3-319-91267-7
ForlagSpringer Publishing Company
Publikationsdato8 mar. 2018
Sider143-163
ISBN (Elektronisk)978-3-319-91268-4
DOI
StatusUdgivet - 8 mar. 2018
BegivenhedInternational Conference on Applications and Theory of Petri Nets and Concurrency - Bratislava, Slovenien
Varighed: 24 jun. 201829 jun. 2018

Konference

KonferenceInternational Conference on Applications and Theory of Petri Nets and Concurrency
LandSlovenien
By Bratislava
Periode24/06/201829/06/2018
NavnLecture Notes in Computer Science
Vol/bind10877
ISSN0302-9743

Fingeraftryk Dyk ned i forskningsemnerne om 'Simplification of CTL Formulae for Efficient Model Checking of Petri Nets'. Sammen danner de et unikt fingeraftryk.

Citationsformater