Abstract
In this paper, we propose a new finite graph, called Timed Aggregate Graph (TAG), abstracting the behavior of bounded Time Petri Nets (TPN) with strong time semantics. The main feature of this abstract representation compared to existing approaches is the used criterion to encapsulate the elapsing of time within each node of the TAG (called aggregate), and how to maintain the relative differences between the firing times of enabled transitions. We prove that the TAG preserves timed traces and reachable states of the corresponding TPN. Another interesting and novel feature of the TAGs is the possibility of extracting an explicit run from any of its traces. Thus, we supply an algorithm that maps an abstract run of the TAG to an explicit timed trace (involving a relative elapsed time before each fired transition) of the corresponding TPN. Moreover, the fact that the TAG preserves the timed behavior of the corresponding TPN makes it directly usable in order to check both event- and state-based timed properties as well as the Zenoness property. Zenoness is a pathological behavior which violate a fundamental progress requirement for timed systems stating that it should be possible for time to diverge. A TPN is said to be Zeno when it admits a run where an infinity of transitions are fired in a finite amount of time. We give an algorithm allowing to detect the Zenoness of bounded TPNs and compare the size of the TAG to two well known approaches namely the state class graph and the zone-based graph methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
I thank Olivier H. Roux who supplied this TPN example during our discussions on the TAG approach.
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. Softw. 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)
Cassez, F., Roux, O.H.: Structural translation from time petri nets to timed automata. Electr. Notes Theor. Comput. Sci. 128(6), 145–160 (2005)
Cassez, F., Roux, O.H.: Structural translation from time petri nets to timed automata. J. Syst. Softw. 79(10), 1456–1468 (2006)
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)
Gardey, G., Roux, O.H., Roux, O.F.: Using zone graph method for computing the state space of a time petri net. In: Niebert, P., Larsen, K.G. (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)
Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Inf. Comput. 111(2), 193–244 (1994)
Klai, K.: On-the-fly model checking of timed properties on time petri nets. In: Proceedings of the International Workshop on Petri Nets and Software Engineering, pp. 35–53 (2014)
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 Dyn. Syst. 16(2), 179–205 (2006)
Merlin, P.M., Farber, D.J.: Recoverability of modular systems. Oper. Syst. Rev. 9(3), 51–56 (1975)
Penczek, W., Pólrola, A., Zbrzezny, A.: SAT-based (parametric) reachability for a class of distributed time petri nets. Trans. Petri Nets Other Models Concurrency 4, 72–97 (2010)
Petri, C.A.: Concepts of net theory. In: MFCS 1973. Mathematical Institute of the Slovak Academy of Sciences (1973)
Pezzè, M., Young, M.: Time petri nets: a primer introduction. In: Tutorial 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)
Toussaint, J., Simonot-Lion, F., Thomesse, J.: Time constraints verification methods based on time petri nets. In: Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS 1997), Tunis, Tunisia, 29–31 October 1997, pp. 262–269 (1997)
Tripakis, S.: Verifying progress in timed systems. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 299–314. Springer, Heidelberg (1999)
Yoneda, T., Ryuba, H.: CTL model checking of time petri nets using geometric regions (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Klai, K. (2015). Timed Aggregate Graph: A Finite Graph Preserving Event- and State-Based Quantitative Properties of Time Petri Nets. In: Koutny, M., Desel, J., Haddad, S. (eds) Transactions on Petri Nets and Other Models of Concurrency X. Lecture Notes in Computer Science(), vol 9410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48650-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-48650-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48649-8
Online ISBN: 978-3-662-48650-4
eBook Packages: Computer ScienceComputer Science (R0)