A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

Alexandre David, Lasse Jacobsen, Morten Jacobsen, Jiri Srba

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review

Abstrakt

Timed-arc Petri nets (TAPN) are a well-known time extension of thePetri net model and several translations to networks of timedautomata have been proposed for this model.We present a direct, DBM-basedalgorithm for forward reachability analysis of bounded TAPNs extended with transport arcs, inhibitor arcs and age invariants.We also give a complete proof of its correctness,including reduction techniques based on symmetries and extrapolation.Finally, we augment the algorithm with a novel state-spacereduction technique introducing a monotonic ordering on markings and prove its soundness even in the presence of monotonicity-breaking features like age invariants and inhibitor arcs. We implement the algorithm within the model-checkerTAPAAL and the experimental results document an encouraging performance compared to verification approaches that translate TAPN models to UPPAAL timed automata.
OriginalsprogEngelsk
TidsskriftElectronic Proceedings in Theoretical Computer Science
Vol/bind102
Sider (fra-til)125-140
Antal sider16
ISSN2075-2180
DOI
StatusUdgivet - 2012
Begivenhed7th International Conference on Systems Software Verification - NICTA, Sydney, Australien
Varighed: 28 nov. 201230 nov. 2012
Konferencens nummer: 7

Konference

Konference7th International Conference on Systems Software Verification
Nummer7
LokationNICTA
LandAustralien
BySydney
Periode28/11/201230/11/2012

Fingeraftryk Dyk ned i forskningsemnerne om 'A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets'. Sammen danner de et unikt fingeraftryk.

Citationsformater