A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/LA09016" target="_blank" >LA09016: Účast ČR v European Research Consortium for Informatics and Mathematics (ERCIM)</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Electronic Proceedings of Theoretical Computer Science

ISSN

2075-2180

e-ISSN

—

Svazek periodika

102

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

16

Strana od-do

125-140

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—