A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking

Lasse Jacobsen, Morten Jacobsen, Mikael Harkjær Møller, Jiri Srba

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review

3 Citationer (Scopus)

Abstrakt

Many formal translations between time dependent models have been proposed over the years. While some of them produce timed bisimilar models, others preserve only reachability or (weak) trace equivalence. We suggest a general framework for arguing when a translation preserves Timed Computation Tree Logic (TCTL) or its safety fragment.The framework works at the level of timed transition systems, making it independent of the modeling formalisms and applicable to many of the translations published in the literature. Finally, we present a novel translation from extended Timed-Arc Petri Nets to Networks of Timed Automata and using the framework argue that itpreserves the full TCTL. The translation has been implemented in the verification tool TAPAAL.
OriginalsprogEngelsk
BogserieLecture Notes in Computer Science
Vol/bind6342
Sider (fra-til)83-98
ISSN0302-9743
DOI
StatusUdgivet - 2010

Fingeraftryk Dyk ned i forskningsemnerne om 'A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking'. Sammen danner de et unikt fingeraftryk.

Citationsformater