Abstract
Verification of timed systems is an important subject of research, and one of its crucial aspects is the efficiency of the methods developed. Extending the result of Popova which states that integer time steps are sufficient to test reachability properties of time Petri nets [8,11], in our work we prove that the discrete-time semantics is also sufficient to verify properties of the existential and the universal version of CTL* of TPNs with the dense semantics. To show that considering this semantics instead of the dense one is profitable, we compare the results for SAT-based bounded model checking of the universal version of CTL_X properties and the class of distributed time Petri nets.
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.
Similar content being viewed by others
References
Abadi, M., Lamport, L.: An old-fashioned recipe for real time. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 1–27. Springer, Heidelberg (1992)
Boyer, M., Diaz, M.: Multiple enabledness in Petri nets with time. In: Proc. of the 9th Int. Workshop on Petri Nets and Performance Models (PNPM 2001), pp. 219–228 (2001)
Goltz, U., Kuiper, R., Penczek, W.: Propositional temporal logics and equivalences. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 222–236. Springer, Heidelberg (1992)
Grumberg, O., Long, D.E.: Model checking and modular verification. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 250–265. Springer, Heidelberg (1991)
Janowska, A., Penczek, W., Półrola, A., Zbrzezny, A.: Towards discrete-time verification of time Petri nets with dense-time semantics. In: Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P 2011), pp. 215–228. Bialystok University of Technology (2011)
Męski, A., Penczek, W., Półrola, A., Woźna-Szcześniak, B., Zbrzezny, A.: Bounded model checking approaches for verificaton of distributed time Petri nets. In: Proc. of the Int. Workshop on Petri Nets and Software Engineering (PNSE 2011), pp. 72–91. University of Hamburg (2011)
Peled, D.: All from one, one for all: On model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 409–423. Springer, Heidelberg (1993)
Popova, L.: On time Petri nets. Elektronische Informationsverarbeitung und Kybernetik 27(4), 227–244 (1991)
Popova-Zeugmann, L.: Essential states in time Petri nets. Informatik-Bericht 96, Humboldt University (1998)
Popova-Zeugmann, L.: Time Petri nets state space reduction using dynamic programming. Journal of Control and Cybernetics 35(3), 721–748 (2006)
Popova-Zeugmann, L., Schlatter, D.: Analyzing paths in time Petri nets. Fundamenta Informaticae 37(3), 311–327 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Janowska, A., Penczek, W., Półrola, A., Zbrzezny, A. (2013). Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets. In: Koutny, M., van der Aalst, W.M.P., Yakovlev, A. (eds) Transactions on Petri Nets and Other Models of Concurrency VIII. Lecture Notes in Computer Science, vol 8100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40465-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-40465-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40464-1
Online ISBN: 978-3-642-40465-8
eBook Packages: Computer ScienceComputer Science (R0)