Article

A framework for relating timed transition systems and preserving TCTL model checking

Authors:

Lasse Jacobsen,

Morten Jacobsen,

Mikael H. Møller,

Jiří SrbaAuthors Info & Claims

EPEW'10: Proceedings of the 7th European performance engineering conference on Computer performance engineering

Pages 83 - 98

Published: 23 September 2010 Publication History

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.

References

[1]

Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126(2), 183-235 (1994)

Digital Library

[2]

Archer, M., HongPing, L., Lynch, N., Mitra, S., Umeno, S.: Specifying and proving properties of timed I/O automata in the TIOA toolkit. In: Proc. of MEMOCODE 2006, pp. 129-138 (2006)

Digital Library

[3]

Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200-236. Springer, Heidelberg (2004)

[4]

Bérard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of the expressiveness of timed automata and time Petri nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 211-225. Springer, Heidelberg (2005)

Digital Library

[5]

Berthomieu, B., Peres, F., Vernadat, F.: Bridging the gap between timed automata and bounded time Petri nets. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 82-97. Springer, Heidelberg (2006)

Digital Library

[6]

Bolognesi, T., Lucidi, F., Trigila, S.: From timed Petri nets to timed LOTOS. In: Proc. of PSTV 1990, pp. 395-408 (1990)

Digital Library

[7]

Boucheneb, H., Gardey, G., Roux, O.H.: TCTL model checking of time Petri nets. Journal of Logic and Computation 19(6), 1509-1540 (2009)

Digital Library

[8]

Bouyer, P., Haddad, S., Reynier, P.A.: Timed Petri nets and timed automata: On the discriminating power of Zeno sequences. Information and Computation 206(1), 73-107 (2008)

Digital Library

[9]

Byg, J., Joergensen, K.Y., Srba, J.: An efficient translation of timed-arc Petri nets to networks of timed automata. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol. 5885, pp. 698-716. Springer, Heidelberg (2009)

Digital Library

[10]

Cassez, F., Roux, O.H.: Structural translation from time Petri nets to timed automata. ENTCS 128(6), 145-160 (2005); Proc. of AVoCS 2004

Digital Library

[11]

Dong, J.S., Hao, P., Qin, S., Sun, J., Yi, W.: Timed Automata Patterns. IEEE Transactions on Software Engingeering 34(6), 844-859 (2008)

Digital Library

[12]

Gardey, G., Lime, D., Magnin, M., Roux, O.H.: Romeo: A tool for analyzing time Petri nets. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 418-423. Springer, Heidelberg (2005)

Digital Library

[13]

Jacobsen, L., Jacobsen, M., Möller, M.H., Srba, J.: A framework for relating timed transition systems and preserving TCTL model checking. Technical Report FIMURS- 2010-09, Faculty of Informatics, Masaryk Univ. (2010)

[14]

Janowska, A., Janowski, P., Wróblewski, D.: Translation of Intermediate Language to Timed Automata with Discrete Data. Fundamenta Informaticae 85(1-4), 235- 248 (2008)

Digital Library

[15]

Merlin, P.M.: A Study of the Recoverability of Computing Systems. PhD thesis, University of California, Irvine (1974)

Digital Library

[16]

Penczek, W., Pólrola, A.: Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. SCI, vol. 20. Springer, Heidelberg (2006)

Digital Library

[17]

Sifakis, J., Yovine, S.: Compositional specification of timed systems. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 347-359. Springer, Heidelberg (1996)

Digital Library

[18]

Srba, J.: Timed-arc Petri nets vs. networks of timed automata. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 385-402. Springer, Heidelberg (2005)

Digital Library

[19]

Srba, J.: Comparing the expressiveness of timed automata and timed extensions of Petri nets. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 15-32. Springer, Heidelberg (2008)

Digital Library

Cited By

Jacobsen LJacobsen MMøller MSrba J(2011)Verification of timed-arc Petri netsProceedings of the 37th international conference on Current trends in theory and practice of computer science10.5555/1946370.1946374(46-72)Online publication date: 22-Jan-2011
https://dl.acm.org/doi/10.5555/1946370.1946374

A framework for relating timed transition systems and preserving TCTL model checking
1. Theory of computation

Recommendations

Efficient TCTL Model Checking Algorithm for Timed Actors
AGERE! '14: Proceedings of the 4th International Workshop on Programming based on Actors Agents & Decentralized Control

Non-Polynomial time complexity of model checking algorithms for TCTL properties in dense time is one of the obstacles against using model checking for timed systems. Alternatively, polynomial time algorithms are suggested for model checking discrete ...
TCTL Model Checking of Time Petri Nets

We consider Time Petri Nets (TPN) for which a firing time interval is associated with each transition. State space abstractions for TPN preserving various classes of properties (LTL, CTL and CTL^*) can be computed, in terms of so called state classes. ...
On-the-fly TCTL model checking for time Petri nets

In this paper, we show how to efficiently model check a subset of TCTL properties for the Time Petri Net model (TPN model), using the state class method. The verification proceeds by augmenting the TPN model under analysis with a special TPN, called ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

EPEW'10: Proceedings of the 7th European performance engineering conference on Computer performance engineering

September 2010

283 pages

ISBN:3642157831

Editors:
Alessandro Aldini
Università di Urbino
,
Marco Bernardo
Università di Urbino
,
Luciano Bononi
Università di Bologna, Dipartimento di Scienze dell'Informazione, Bologna, Italy
,
Vittorio Cortellessa
Università dell'Aquila, Dipartimento di Informatica, L'Aquila, Italy

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 September 2010

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jacobsen LJacobsen MMøller MSrba J(2011)Verification of timed-arc Petri netsProceedings of the 37th international conference on Current trends in theory and practice of computer science10.5555/1946370.1946374(46-72)Online publication date: 22-Jan-2011
https://dl.acm.org/doi/10.5555/1946370.1946374

View Options

View options

Media

Figures

Other

Tables

View Table of Contents