Abstract
This paper deals with verification of reachability properties on Time Petri Nets (TPN). TPNs allow the specification of real-time systems involving timing constraints explicitly. The main challenge of the analysis of such systems is to construct a finite abstraction of the corresponding (infinite) state graph preserving timed properties. Thus, we propose a new finite graph, called Timed Aggregate Graph (TAG), abstracting the behaviour of bounded TPNs with strong time semantics. The main feature the TAG compared to existing approaches is the encoding of the time information within the nodes of this graph. This allows to compute the minimum and maximum elapsed time in every path of the graph. The TAG preserves runs and reachable states of the corresponding TPN which allows for the verification of both event- and state-based properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)
Berthomieu, B., Diaz, M.: Modeling and Verification of Time Dependent Systems Using Time Petri Nets. IEEE Trans. Software Eng. 17(3), 259–273 (1991)
Berthomieu, B., Menasche, M.: An Enumerative Approach for Analyzing Time Petri Nets. In: IFIP Congress, pp. 41–46 (1983)
Berthomieu, B., Vernadat, F.: State Class Constructions for Branching Analysis of Time Petri Nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 442–457. Springer, Heidelberg (2003)
Berthomieu, B., Vernadat, F.: Time Petri Nets Analysis with TINA. In: QEST, pp. 123–124 (2006)
Boucheneb, H., Gardey, G., Roux, O.H.: TCTL Model Checking of Time Petri Nets. J. Log. Comput. 19(6), 1509–1540 (2009)
Boyer, M., Roux, O.H.: Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 63–82. Springer, Heidelberg (2007)
Gardey, G., Roux, O.H., Roux, O.F.: Using Zone Graph Method for Computing the State Space of a Time Petri Net. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, pp. 246–259. Springer, Heidelberg (2004)
Hadjidj, R., Boucheneb, H.: Improving state class constructions for CTL* model checking of time Petri nets. STTT 10(2), 167–184 (2008)
Hadjidj, R., Boucheneb, H.: On-the-fly TCTL model checking for time Petri nets. Theor. Comput. Sci. 410(42), 4241–4261 (2009)
Klai, K., Aber, N., Petrucci, L.: To appear in a new approach to abstract reachability state space of time petri nets. In: TIME, Lecture Notes in Computer Science. Springer (2013)
Larsen, K.G., Pettersson, P., Yi, W.: Model-checking for real-time systems. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 62–88. Springer, Heidelberg (1995)
Lime, D., Roux, O.H.: Model Checking of Time Petri Nets Using the State Class Timed Automaton. Discrete Event Dynamic Systems 16(2), 179–205 (2006)
Merlin, P.M., Farber, D.J.: Recoverability of modular systems. Operating Systems Review 9(3), 51–56 (1975)
Penczek, W., Pólrola, A., Zbrzezny, A.: SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets. T. Petri Nets and Other Models of Concurrency 4, 72–97 (2010)
Petri, C.A.: Concepts of net theory. In: MFCS 1973, pp. 137–146. Mathematical Institute of the Slovak Academy of Sciences (1973)
Pezzè, M., Young, M.: Time Petri Nets: A Primer Introduction. Tutorial Presented at the Multi-Workshop on Formal Methods in Performance Evaluation and Applications (1999)
Ramchandani, C.: Analysis of asynchronous concurrent systems by timed Petri nets. Technical report, Cambridge, MA, USA (1974)
Sifakis, J.: Use of Petri nets for performance evaluation. Acta Cybern. 4, 185–202 (1980)
Yoneda, T., Ryuba, H.: CTL model checking of time Petri nets using geometric regions (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klai, K., Aber, N., Petrucci, L. (2013). Verification of Reachability Properties for Time Petri Nets. In: Abdulla, P.A., Potapov, I. (eds) Reachability Problems. RP 2013. Lecture Notes in Computer Science, vol 8169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41036-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-41036-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41035-2
Online ISBN: 978-3-642-41036-9
eBook Packages: Computer ScienceComputer Science (R0)