TCTL-preserving translations from timed-arc Petri nets to networks of timed automata

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We present a framework for TCTL-preserving translations between time-dependent modeling formalisms. The framework guarantees that once the original and the translated system are in one-by-many correspondence relation (a notion of behavioral 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.

Cite

CITATION STYLE

APA

Byg, J., Jacobsen, M., Jacobsen, L., Jørgensen, K. Y., Møller, M. H., & Srba, J. (2014). TCTL-preserving translations from timed-arc Petri nets to networks of timed automata. Theoretical Computer Science, 537(C), 3–28. https://doi.org/10.1016/j.tcs.2013.07.011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free