| DAVID, Alexandre, Lasse JACOBSEN, Morten JACOBSEN and Jiří SRBA. A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets. Electronic Proceedings of Theoretical Computer Science. Nizozemi: Open Publishing Association, 2012, vol. 102, No 1, p. 125-140. ISSN 2075-2180. Available from: https://dx.doi.org/10.4204/EPTCS.102.12. |
Other formats:
BibTeX
LaTeX
RIS
@article{1079020,
author = {David, Alexandre and Jacobsen, Lasse and Jacobsen, Morten and Srba, Jiří},
article_location = {Nizozemi},
article_number = {1},
doi = {http://dx.doi.org/10.4204/EPTCS.102.12},
keywords = {Petri nets; verification; timed systems; reachability},
language = {eng},
issn = {2075-2180},
journal = {Electronic Proceedings of Theoretical Computer Science},
title = {A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets},
url = {http://rvg.web.cse.unsw.edu.au/eptcs/content.cgi?SSV2012},
volume = {102},
year = {2012}
}
TY - JOUR
ID - 1079020
AU - David, Alexandre - Jacobsen, Lasse - Jacobsen, Morten - Srba, Jiří
PY - 2012
TI - A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
JF - Electronic Proceedings of Theoretical Computer Science
VL - 102
IS - 1
SP - 125-140
EP - 125-140
PB - Open Publishing Association
SN - 20752180
KW - Petri nets
KW - verification
KW - timed systems
KW - reachability
UR - http://rvg.web.cse.unsw.edu.au/eptcs/content.cgi?SSV2012
L2 - http://rvg.web.cse.unsw.edu.au/eptcs/content.cgi?SSV2012
N2 - 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.
ER -
DAVID, Alexandre, Lasse JACOBSEN, Morten JACOBSEN and Jiří SRBA. A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets. \textit{Electronic Proceedings of Theoretical Computer Science}. Nizozemi: Open Publishing Association, 2012, vol.~102, No~1, p.~125-140. ISSN~2075-2180. Available from: https://dx.doi.org/10.4204/EPTCS.102.12.
|
