Journal of Computing Science and Engineering

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

Improved Region-Based TCTL Model Checking of Time Petri Nets

  • Received : 2014.08.23
  • Accepted : 2015.02.28
  • Published : 2015.03.30
Download PDF
⟨ Previous Next ⟩

Abstract

The most important challenge in the region-based abstraction method as an approach to compute the state space of time Petri Nets (TPNs) for model checking is that the method results in a huge number of regions, causing a state explosion problem. Thus, region-based abstraction methods are not appropriate for use in developing practical tools. To address this limitation, this paper applies a modification to the basic region abstraction method to be used specially for computing the state space of TPN models, so that the number of regions becomes smaller than that of the situations in which the current methods are applied. The proposed approach is based on the special features of TPN that helps us to construct suitable and small region graphs that preserve the time properties of TPN. To achieve this, we use TPN-TCTL as a timed extension of CTL for specifying a subset of properties in TPN models. Then, for model checking TPN-TCTL properties on TPN models, CTL model checking is used on TPN models by translating TPN-TCTL to the equivalent CTL. Finally, we compare our proposed method with the current region-based abstraction methods proposed for TPN models in terms of the size of the resulting region graph.

Keywords

References

  1. R. Alur, C. Courcoubetis, and D. Dill, "Model-checking in dense real-time," Information and Computation, vol. 104, no. 1, pp. 2-34, 1993. https://doi.org/10.1006/inco.1993.1024
  2. R. Alur and D. Dill, "The theory of timed automata," in Real-Time: Theory in Practice, Lecture Notes in Computer Science vol. 600, Heidelberg: Springer, pp. 45-73, 1992.
  3. P. M. Merlin and D. J. Farber, "Recoverability of communication protocols: implications of a theoretical study," IEEE Transactions on Communications, vol. 24, no. 9, pp. 1036-1043, 1976. https://doi.org/10.1109/TCOM.1976.1093424
  4. C. Ramchandani, "Analysis of asynchronous concurrent systems by timed Petri nets," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, USA, 1974.
  5. F. Cassez and O. H. Roux, "Structural translation from time Petri nets to timed automata," Journal of Systems and Software, vol. 79, no. 10, pp. 1456-1468, 2006. https://doi.org/10.1016/j.jss.2005.12.021
  6. D. D'Aprile, S. Donatelli, A. Sangnier, and J. Sproston, "From time petri nets to timed automata: an untimed approach," in Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science vol. 4424, Heidelberg: Springer, pp. 216-230, 2007.
  7. D. Lime and O. H. Roux, "State class timed automaton of a time Petri net," in Proceedings of the 10th International Workshop on Petri Nets and Performance Models (PNPM'03), Urbana, Etats-Unis, 2003, pp. 124-133.
  8. B. Berthomieu and M. Diaz, "Modeling and verification of time dependent systems using time Petri nets," IEEE Transactions on Software Engineering, vol. 17, no. 3, pp. 259-273, 1991. https://doi.org/10.1109/32.75415
  9. B. Berthomieu and M. Menasche, "An enumerative approach for analyzing time Petri nets," in Proceedings of the IFIP Congress, Paris, France, 1983, pp. 41-46.
  10. B. Berthomieu and F. Vernadat, "State class constructions for branching analysis of time Petri nets," in Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science vol. 2619, Heidelberg: Springer, pp. 442-457, 2003.
  11. H. Boucheneb, G. Gardey, and O. H. Roux, "TCTL model checking of time Petri nets," Journal of Logic and Computation, vol. 19, no. 6, pp. 1509-1540, 2009. https://doi.org/10.1093/logcom/exp036
  12. G. Gardey, O. H. Roux, and O. F. Roux, "Using zone graph method for computing the state space of a time Petri net," in Formal Modeling and Analysis of Timed Systems, Lecture Notes in Computer Science vol. 2791, Heidelberg: Springer, pp. 246-259, 2004.
  13. R. Hadjidj and H. Boucheneb, "On-the-fly TCTL model checking for time Petri nets using state class graphs," in Proceedings of the 6th International Conference on Application of Concurrency to System Design, Turku, Finland, 2006, pp. 111-122.
  14. T. Yoneda and H. Ryuba, "CTL model checking of time Petri nets using geometric regions," IEICE Transactions on Information and Systems, vol. 81, no. 3, pp. 297-306, 1998.
  15. Y. Okawa and T. Yoneda, "Symbolic computation tree logic model checking of time Petri nets," Electronics and Communications in Japan (Part III: Fundamental Electronic Science), vol. 80, no. 4, pp. 11-20, 1997.
  16. C. Baier and J. P. Katoen, Principles of Model Checking, Cambridge, MA: MIT Press, 2008.
  17. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, "Symbolic model checking for real-time systems," Information and Computation, vol. 111, no. 2, pp. 193-244, 1994. https://doi.org/10.1006/inco.1994.1045
  18. I. Virbitskaite and E. Pokozy, "A partial order method for the verification of time Petri nets," in Fundamentals of Computation Theory, Lecture Notes in Computer Science vol. 1684, Heidelberg: Springer, pp. 547-558, 1999.
  19. W. Penczek and A. Polrola, "Specification and model checking of temporal properties in time Petri nets and timed automata," in Applications and Theory of Petri Nets 2004, Lecture Notes in Computer Science vol. 3099, Heidelberg: Springer, pp. 37-76, 2004.

Cited by

  1. Model checking Petri nets with MSVL vol.363, 2016, https://doi.org/10.1016/j.ins.2016.01.036