TCTL-Preserving Translations from Timed-Arc {P}etri Nets to
Networks of Timed Automata

J 2014

TCTL-Preserving Translations from Timed-Arc {P}etri Nets to Networks of Timed Automata

BYG, Joakim; Morten JACOBSEN; Lasse JACOBSEN; Kenneth Yrke JORGENSEN; Mikael H. MOLLER et al.

Základní údaje

Originální název

TCTL-Preserving Translations from Timed-Arc {P}etri Nets to Networks of Timed Automata

Autoři

BYG, Joakim; Morten JACOBSEN; Lasse JACOBSEN; Kenneth Yrke JORGENSEN; Mikael H. MOLLER a Jiří SRBA

Vydání

Theoretical Computer Science, Amsterdam, Elsevier, 2014, 0304-3975

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Obor

10402 Inorganic and nuclear chemistry

Stát vydavatele

Nizozemské království

Utajení

není předmětem státního či obchodního tajemství

Odkazy

Link to publisher

Impakt faktor

Impact factor: 0.657

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14330/14:00080031

Organizační jednotka

Fakulta informatiky

Klíčová slova anglicky

timed-arc Petri nets; model checking; verification; timed systems

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 27. 4. 2015 05:00, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

We present a framework for TCTL-preserving translations between time-dependent modelling formalisms. The framework guarantees that once the original and the translated system are in one-by-many correspondence relation (a notion of behavioural equivalence between timed transition systems) then TCTL properties of the original system can be transformed too while preserving the verification answers. We demonstrate the usability of the technique on two reductions from bounded timed-arc Petri nets to networks for timed automata, providing unified proofs of the translations implemented in the verification tool TAPAAL. We evaluate the efficiency of the approach on a number of experiments: alternating bit protocol, Fischer's protocol, Lynch-Shavit protocol, MPEG-2 encoder, engine workshop and medical workflow. The results are encouraging and confirm the practical applicability of the approach.

Citovat

BYG, Joakim; Morten JACOBSEN; Lasse JACOBSEN; Kenneth Yrke JORGENSEN; Mikael H. MOLLER a Jiří SRBA. TCTL-Preserving Translations from Timed-Arc {P}etri Nets to Networks of Timed Automata. Theoretical Computer Science. Amsterdam: Elsevier, 2014, roč. 537, č. 5, s. 3-28. ISSN 0304-3975. Dostupné z: https://doi.org/10.1016/j.tcs.2013.07.011.

@article{1297394,
   author = {Byg, Joakim and Jacobsen, Morten and Jacobsen, Lasse and Jorgensen, Kenneth Yrke and Moller, Mikael H. and Srba, Jiří},
   article_location = {Amsterdam},
   article_number = {5},
   doi = {https://doi.org/10.1016/j.tcs.2013.07.011},
   keywords = {timed-arc Petri nets; model checking; verification; timed systems},
   language = {eng},
   issn = {0304-3975},
   journal = {Theoretical Computer Science},
   title = {TCTL-Preserving Translations from Timed-Arc {P}etri Nets to Networks of Timed Automata},
   url = {http://dx.doi.org/10.1016/j.tcs.2013.07.011},
   volume = {537},
   year = {2014}
}

TY  - JOUR
ID  - 1297394
AU  - Byg, Joakim - Jacobsen, Morten - Jacobsen, Lasse - Jorgensen, Kenneth Yrke - Moller, Mikael H. - Srba, Jiří
PY  - 2014
TI  - TCTL-Preserving Translations from Timed-Arc {P}etri Nets to Networks of Timed Automata
JF  - Theoretical Computer Science
VL  - 537
IS  - 5
SP  - 3-28
EP  - 3-28
PB  - Elsevier
SN  - 03043975
KW  - timed-arc Petri nets
KW  - model checking
KW  - verification
KW  - timed systems
UR  - http://dx.doi.org/10.1016/j.tcs.2013.07.011
L2  - http://dx.doi.org/10.1016/j.tcs.2013.07.011
N2  - We present a framework for TCTL-preserving translations between time-dependent modelling formalisms. The framework guarantees that once the original and the translated system are in one-by-many correspondence relation (a notion of behavioural equivalence between timed transition systems) then TCTL properties of the original system can be transformed too while preserving the verification answers. We demonstrate the usability of the technique on two reductions from bounded timed-arc Petri nets to networks for timed automata, providing unified proofs of the translations implemented in the verification tool TAPAAL. We evaluate the efficiency of the approach on a number of experiments: alternating bit protocol, Fischer's protocol, Lynch-Shavit protocol, MPEG-2 encoder, engine workshop and medical workflow. The results are encouraging and confirm the practical applicability of the approach.
ER  -

BYG, Joakim; Morten JACOBSEN; Lasse JACOBSEN; Kenneth Yrke JORGENSEN; Mikael H. MOLLER a Jiří SRBA. TCTL-Preserving Translations from Timed-Arc $\{$P$\}$etri Nets to Networks of Timed Automata. \textit{Theoretical Computer Science}. Amsterdam: Elsevier, 2014, roč.~537, č.~5, s.~3-28. ISSN~0304-3975. Dostupné z: https://doi.org/10.1016/j.tcs.2013.07.011.

Přehled o publikaci