Abstract
This paper is concerned with construction of some state space abstractions for Time Petri nets. State class spaces were introduced long ago by Berthomieu and Menasche as finite representations for the typically infinite state spaces of Time Petri nets, preserving their linear time temporal properties. This paper proposes a similar construction that preserves their branching time temporal properties. The construction improves a previous proposal by Yoneda and Ryuba. The method has been implemented, computing experiments are reported.
This work was partially supported by RNTL Projet COTRE (www.laas.fr/COTRE)
Chapter PDF
Keywords
References
R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proc. 5th IEEE Symposium on Logic in Computer Science, pages 414–425, june 1990.
R. Alur, C. Courcoubetis, N. Halbwachs, D.L. Dill, and H. Wong-Toi. Minimization of timed transition systems. In CONCUR 92: Theories of Concurrency, Springer LNCS 630, pages 340–354, 1996.
M. C. Browne, E. M. Clarke, and O. Grümberg. Characterizing finite kripke structures in propositional temporal logics. Theoretical Computer Science, 59:115–131, 1988.
B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Transactions on Software Engineering, 17(3):259–273, March 1991.
B. Berthomieu. La méthode des classes d’tats pour l’analyse des rśeaux temporels-mise enœuvre, extension ĺa multi-sensibilisation. In Proc. Modélisation des Systémes Ráctifs, Toulouse, France, October 2001.
B. Berthomieu. The Tina V2 Toolbox. http://www.laas.fr/tina, LAAS/CNRS, 2001.
B. Berthomieu and M. Menasche. An enumerative approach for analyzing time Petri nets. IFIP Congress Series, 9:41–46, 1983.
J-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A protocol validation and verification toolbox. In 8th Conference on Computer-Aided Verification, CAV’96, Springer LNCS 1102, July 1996.
P. K. Kanellakis and S. A. Smolka. Ccs expressions, finite state processes, and three problems of equivalence. Information and Computation, 86:43–68, 1990.
R. De Nicola and F. Vandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458–487, 1995.
W. Penczek and A. Pólrola. Abstraction and partial order reductions for checking branching properties of time petri nets. In Proc. of ICATPN, Springer LNCS 2075, pages 323–342, 2001.
P. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973–989, 1987.
S. Tripakis and S. Yovine. Analysis of timed systems based on time-abstracting bisimulations. In 8th Conference Computer-Aided Verification, CAV’96, Springer LNCS 1102, pages 232–243, jul 1996.
S. Yovine. Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer, 1(1), 1997.
T. Yoneda and H. Ryuba. CTL model checking of Time Petri nets using geometric regions. IEEE Transactions on Information and Systems, E99-D(3):1–10, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berthomieu, B., Vernadat, F. (2003). State Class Constructions for Branching Analysis of Time Petri Nets. In: Garavel, H., Hatcliff, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol 2619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36577-X_33
Download citation
DOI: https://doi.org/10.1007/3-540-36577-X_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00898-9
Online ISBN: 978-3-540-36577-8
eBook Packages: Springer Book Archive