A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00062417" target="_blank" >RIV/00216224:14330/12:00062417 - isvavai.cz</a>
Result on the web
<a href="http://rvg.web.cse.unsw.edu.au/eptcs/content.cgi?SSV2012" target="_blank" >http://rvg.web.cse.unsw.edu.au/eptcs/content.cgi?SSV2012</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4204/EPTCS.102.12" target="_blank" >10.4204/EPTCS.102.12</a>
Alternative languages
Result language
angličtina
Original language name
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
Original language description
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 boundedTAPNs 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LA09016" target="_blank" >LA09016: Czech Republic membership in the European Research Consortium for Informatics and Mathematics (ERCIM)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Electronic Proceedings of Theoretical Computer Science
ISSN
2075-2180
e-ISSN
—
Volume of the periodical
102
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
16
Pages from-to
125-140
UT code for WoS article
—
EID of the result in the Scopus database
—