Chapter

Computer Performance Engineering

Volume 6342 of the series Lecture Notes in Computer Science pp 83-98

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

  • Lasse JacobsenAffiliated withLancaster UniversityDepartment of Computer Science, Aalborg University
  • , Morten JacobsenAffiliated withLancaster UniversityDepartment of Computer Science, Aalborg University
  • , Mikael H. MøllerAffiliated withLancaster UniversityDepartment of Computer Science, Aalborg University
  • , Jiří SrbaAffiliated withLancaster UniversityDepartment of Computer Science, Aalborg University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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 it preserves the full TCTL. The translation has been implemented in the verification tool TAPAAL.