Specification and model checking of temporal properties in time petri nets and timed automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3099, Issue , 2004, Pages 37-76

  Penczek, Wojciech ^a,b,c   Pólrola, Agata ^a,b,c  

^a POLISH ACADEMY OF SCIENCES   (Poland)

^b SIEDLCE UNIVERSITY OF NATURAL SCIENCES AND HUMANITIES   (Poland)

^c UNIVERSITY OF LODZ   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; INTERACTIVE COMPUTER SYSTEMS; PETRI NETS; REAL TIME SYSTEMS; TEMPORAL LOGIC;

BOUNDED MODEL CHECKING; MODEL ABSTRACTION; PARTITION REFINEMENT; STRUCTURAL TRANSLATION; TEMPORAL PROPERTY; UNBOUNDED MODEL CHECKING; VERIFICATION METHOD; VERIFICATION TECHNIQUES;

MODEL CHECKING;

EID: 35048827538     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27793-4_4     Document Type: Article

References (93)

1. P. A. Abdulla and A. Nylén. Timed Petri Nets and BQOs. In Proc. of ICATPN'01, volume 2075 of LNCS, pages 53-70. Springer-Verlag, 2001.
2. R. Alur, C. Courcoubetis, and D. Dill. Model checking for real-time systems. In Proc. of LICS'90, pages 414-425. IEEE, 1990.
3. R. Alur, C. Courcoubetis, and D. Dill. Model checking in dense real-time. Information and Compulation, 104(l):2-34, 1993.
4. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In Proc. of RTSS'92, pages 157-166. IEEE Comp. Soc. Press, 1992.
5. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In Proc. of CONCUR '92, volume 630 of LNCS, pages 340-354. Springer-Verlag, 1992.
6. R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of ICALP'90, volume 443 of LNCS, pages 322-335. Springer-Verlag, 1990.
7. R. Alur, T. Henzinger, and P. Ho. Automatic symbolic verification of embedded systems. IEEE Trans, on Software Eng., 22(3): 181-201, 1996.
8. R. Alur and R. Kurshan. Timing analysis in COSPAN. In Hybrid Systems III, volume 1066 of LNCS, pages 220-231. Springer-Verlag, 1996.
9. E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli, and A. Rasse. Datastructures for the verification of Timed Automata. In Proc. of HART'97, volume 1201 of LNCS, pages 346-360. Springer-Verlag, 1997.
10. G. Audemard, A. Cimatti, A. Kornilowicz, and R. Sebastiani. Bounded model checking for timed systems. In Proc. of FORTE'02, volume 2529 of LNCS, pages 243-259. Springer-Verlag, 2002.
11. G. Behrmann, K. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient timed reachability analysis using Clock Difference Diagrams. In Proc. of CAV'99, volume 1633 of LNCS, pages 341-353. Springer-Verlag, 1999.
12. J. Bengtsson. Clocks, DBMs and States in Timed Systems. PhD thesis, Dept. of Information Technology, Uppsala University, 2002.
13. J. Bengtsson and W. Yi. On clock difference constraints and termination in reachability analysis in Timed Automata. In Proc. of ICFEM'03, volume 2885 of LNCS, pages 491-503. Springer-Verlag, 2003.
14. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using Time Petri Nets. IEEE Trans, on Software Eng., 17(3):259-273, 1991.
15. B. Berthomieu and M. Menasche. An enumerative approach for analyzing Time Petri Nets. In Proc. of the IFIP 9th World Computer Congress, volume 9 of Information Processing, pages 41-46. North Holland/ IFIP, September 1983.
16. B. Berthomieu, P-O. Ribet, and F. Vernadat. The tool TINA - construction of abstract state spaces for Petri nets and Time Petri Nets. International Journal of Production Research, 2004. to appear.
17. B. Berthomieu and F. Vernadat. State class constructions for branching analysis of Time Petri Nets. In Proc. of TACAS'03, volume 2619 of LNCS, pages 442-457. Springer-Verlag, 2003.
18. D. Beyer. Rabbit: Verification of real-time systems. In Proc. of the Workshop on Real-Time Tools (RT-TOOLS'01), pages 13-21, 2001.
19. A. Bobbio and A. Horváth. Model checking time Petri nets using NuSMV. In Proc. of the 5th Int. Workshop on Performability Modeling of Computer and Communication Systems (PMCCS5), pages 100-104, September 2001.
20. A. Bouajjani, J-C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. Science of Computer Programming, 18:247-269, 1992.
21. A. Bouajjani, S. Tripakis, and S. Yovine. On-the-fly symbolic model checking for real-time systems. In Proc. of RTSS'97, pages 232-243. IEEE Comp. Soc. Press, 1997.
22. H. Boucheneb and G. Berthelot. Towards a simplified building of Time Petri Nets reachability graph. In Proc. of the 5th Int. Workshop on Petri Nets and Performance Models, pages 46-55, October 1993.
23. F. Bowden. Modelling time in Petri nets. In Proc. of the 2nd Australia-Japan Workshop on Stochastic Models (STOMOD'96), July 1996.
24. R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers, 35(8):677-691, 1986.
25. F. Cassez and O. H. Roux. Traduction structurelle des Réseaux de Petri Temporels vers le Automates Temporisés. In Proc. of 4ieme Colloque Francophone sur la Modelisation des Systémes Réactifs (MSR'03). Hermes Science, October 2003.
26. G. Ciardo, G. Lüttgen, and R. Simniceanu. Efficient symbolic state-space construction for asynchronous systems. In Proc. of ICATPN'00, volume 1825 of LNCS, pages 103-122. Springer-Verlag, 2000.
27. J. Coolahan and N. Roussopoulos. Timing requirements for time-driven systems using augmented Petri nets. IEEE Trans, on Software Eng., SE-9(5):603-616, 1983.
28. L. A. Cortés, P. Eles, and Z. Peng. Verification of real-time embedded systems using Petri net models and Timed Automata. In Proc. of the 8th Int. Conf. on Real-Time Computing Systems and Applications (RTCSA '02), pages 191-199, March 2002.
29. J-M. Couvreur, E. Encrenaz, E. Paviot-Adet, D. Pointrenaud, and P-A. Wacrenier. Data Decision Diagrams for Petri net analysis. In Proc. of ICATPN'02, volume 2360 of LNCS, pages 101-120. Springer-Verlag, 2002.
30. C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In Proc. of TACAS'98, volume 1384 of LNCS, pages 313-329. Springer-Verlag, 1998.
31. P. Dembiński, A. Janowska, P. Janowski, W. Penczek, A. Polrola, M. Szreter, B. Wozna, and A. Zbrzezny. VerICS: A tool for verifying Timed Automata and Estelle specifications. In Proc. of TACAS'03, volume 2619 of LNCS, pages 278283. Springer-Verlag, 2003.
32. P. Dembinski, W. Penczek, and A. Polrola. Verification of Timed Automata based on similarity. Fundamenta Informaticae, 51(l-2):59-89, 2002.
33. M. Dickhofer and T. Wilke. Timed Alternating Tree Automata: The automatatheoretic solution to the TCTL model checking problem. In Proc. of ICALP'98, volume 1664 of LNCS, pages 281-290. Springer-Verlag, 1998.
34. D. Dill. Timing assumptions and verification of finite state concurrent systems. In Automatic Verification Methods for Finite-State Systems, volume 407 of LNCS, pages 197 - 212. Springer-Verlag, 1989.
35. G. Gardey, O. H. Roux, and O. F. Roux. Using zone graph method for computing the state space of a Time Petri Net. In Proc. of FORMATS'03, volume 2791 of LNCS. Springer-Verlag, 2004.
36. Z. Gu and K. Shin. Analysis of event-driven real-time systems with Time Petri Nets. In Proc. of DIPES'02, volume 219 of IFIP Conference Proceedings, pages 31-40. Kluwer, 2002.
37. S. Haar, L. Kaiser, F. Simonot-Lion, and J. Toussaint. On equivalence between Timed State Machines and Time Petri Nets. Technical Report RR-4049, INRIA Rhône-Alpes, 655, avenue de I'Europe, 38330 Montbonnot-St-Martin, November 2000.
38. H-M. Hanisch. Analysis of place/transition nets with timed arcs and its application to batch process control. In Proc. of ICATPN'93, volume 691 of LNCS, pages 282299. Springer-Verlag, 1993.
39. T. Henzinger and P. Ho. HyTech: The Cornell hybrid technology tool. In Hybrid Systems II, volume 999 of LNCS, pages 265-293. Springer-Verlag, 1995.
40. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-224, 1994.
41. M. Huhn, P. Niebert, and F. Wallner. Verification based on local states. In Proc. of TACAS'98, volume 1384 of LNCS, pages 36-51. Springer-Verlag, 1998.
42. H. Hulgaard and S. M. Burns. Efficient timing analysis of a class of Petri Nets. In Proc. of CAV'95, volume 939 of LNCS, pages 923-936. Springer-Verlag, 1995.
43. R. Janicki. Nets, sequential components and concurrency relations. Theoretical Computer Science, 29:87-121, 1984.
44. I. Kang and I. Lee. An efficient state space generation for the analysis of real-time systems. In Proc. of Int. Symposium on Software Testing and Analysis, 1996.
45. O. Kupferman, T. A. Henzinger, and M. Y. Vardi. A space-efficient on-the-fly algorithm for real-time model checking. In Proc. of CONCUR'96, volume 1119 of LNCS, pages 514-529. Springer-Verlag, 1996.
46. K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi. Efficient verification of realtime systems: Compact data structures and state-space reduction. In Proc. of RTSS'97, pages 14-24. IEEE Comp. Soc. Press, 1997.
47. D. Lee and M. Yannakakis. On-line minimization of transition systems. In Proc. of the 24th ACM Symp. on the Theory of Computing, pages 264-274, May 1992.
48. J. Lilius. Efficient state space search for Time Petri Nets. In Proc. of MFCS Workshop on Concurrency, Brno'98, volume 18 of ENTCS. Elsevier Science Publishers, 1999.
49. D. Lime and O. H. Roux. State class timed automaton of a time Petri net. In Proc. of the 10th Int. Workshop on Petri Nets and Performance Models (PNPM'03). IEEE Comp. Soc. Press, September 2003.
50. K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. of CAV'02, volume 2404 of LNCS, pages 250-264. Springer-Verlag, 2002.
51. P. Merlin and D. J. Farber. Recoverability of communication protocols - implication of a theoretical study. IEEE Trans, on Communications, 24(9):1036-1043, 1976.
52. A. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In Proc. of ICATPN'99, volume 1639 of LNCS, pages 6-25. Springer-Verlag, 1999.
53. P. Molinaro, D. Roux, and O. Delfieu. Improving the calculus of the marking graph of Petri net with BDD like structure. In Proc. of the 2nd IEEE Int. Conf. on Systems, Man and Cybernetics (SMC'02). IEEE Comp. Soc. Press, October 2002.
54. J. Møller, J. Lichtenberg, H. Andersen, and II. Hulgaard. Difference Decision Diagrams. In Proc. of CSL'99, volume 1683 of LNCS, pages 111-125. Springer-Verlag, 1999.
55. J. Møller, J. Lichtenberg, H. Andersen, and H. Hulgaard. Fully symbolic model checking of timed systems using Difference Decision Diagrams. In Proc. of FLoC'99, volume 23(2) of ENTCS, 1999.
56. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. of the 38th Design Automation Conference (DAC'01), pages 530-535, June 2001.
57. P. Niebert, M. Mahfoudh, E. Asarin, M. Bozga, O. Maler, and N. Jain. Verification of Timed Automata via satisfiability checking. In Proc. of FTRTFT'02, volume 2469 of LNCS, pages 226-243. Springer-Verlag, 2002.
58. Y. Okawa and T. Yoneda. Symbolic CTL model checking of Time Petri Nets. Electronics and Communications in Japan, Scripta Technica, 80(4):11-20, 1997.
59. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
60. E. Pastor, J. Cortadella, and O. Roig. Symbolic Petri net analysis using boolean manipulation. Technical Report RR-97-08, UP/DAG, Univerisitat Politécnica de Catalunya, February 1997.
61. W. Penczek and A. Pólrola. Abstractions and partial order reductions for checking branching properties of Time Petri Nets. In Proc. of ICATPN'01, volume 2075 of LNCS, pages 323-342. Springer-Verlag, 2001.
62. W. Penczek, B. Woźna, and A. Zbrzezny. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae, 51(1-2):135-156, 2002.
63. W. Penczek, B. Wozna, and A. Zbrzezny. Towards bounded model checking for the universal fragment of TCTL. In Proc. of FTRTFT'02, volume 2469 of LNCS, pages 265-288. Springer-Verlag, 2002.
64. A. Pólrola and W. Penczek. Minimization algorithms for Time Petri Nets. Fundamenta Informaticae, 2004. to appear.
65. A. Pólrola, W. Penczek, and M. Szreter. Reachability analysis for Timed Automata using partitioning algorithms. Fundamenta Informaticae, 55(2):203-221, 2003.
66. A. Pólrola, W. Penczek, and M. Szreter. Towards efficient partition refinement for checking reachability in Timed Automata. In Proc. of FORMATS'03, volume 2791 of LNCS. Springer-Verlag, 2004.
67. L. Popova and S. Marek. TINA - a tool for analyzing paths in TPNs. In Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P'02), volume 110 of Informatik-Berichte, pages 195-196. Humboldt University, 1998.
68. C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets. Technical Report MAC-TR-120, Massachusets Institute of Technology, February 1974.
69. A. Ratzer, L. Wells, H. Lassen, M. Laursen, J. Qvortrup, M. Stissing, M."Westergaard, S. Christensen, and K. Jensen. CPN Tools for editing, simulating, and analyzing Coloured Petri Nets. In Proc. of ICATPN'03, volume 2679 of LNCS, pages 450-462. Springer-Verlag, 2003.
70. Romeo: A tool for Time Petri Net analysis. http://www.irccyn.ec-nantes. fr/irccyn/d/en/equipes/TempsReel/logs, 2000.
71. S. Samolej and T. Szmuc. Modelowanie systemów czasu rzeczywistego z zastosowaniem czasowych sieci Petriego. In Mat. IX Konf. Systemy Czasu Rzeczywistego (SCR'02), pages 45-54. Instytut Informatyki Politechniki Śla̧skiej, 2002. In Polish.
72. P. Sénac, M. Diaz, and P. de Saqui Sannes. Toward a formal specification of multimedia scenarios. Annals of Telecommunications, 49(5-6):297-314, 1994.
73. S. Seshia and R. Bryant. Unbounded, fully symbolic model checking of Timed Automata using boolean methods. In Proc. of CAV'03, volume 2725 of LNCS, pages 154-166. Springer-Verlag, 2003.
74. J. Sifakis and S. Yovine. Compositional specification of timed systems. In Proc. of STACS'96, volume 1046 of LNCS, pages 347-359. Springer-Verlag, 1996.
75. M. Sorea. Bounded model checking for Timed Automata. In Proc. of MTCS'02, volume 68(5) of ENTCS. Elsevier Science Publishers, 2002.
76. R. L. Spelberg, H. Toetenel, and M. Ammerlaan. Partition refinement in real-time model checking. In Proc. of FTRTFT'98, volume 1486 of LNCS, pages 143-157. Springer-Verlag, 1998.
77. K. Strehl and L. Thiele. Interval diagram techniques for symbolic model checking of Petri nets. In Proc. of DATE'99, LNCS, pages 756-757. IEEE Comp. Soc. Press, 1999.
78. O. Strichman, S. Seshia, and R. Bryant. Deciding separation formulas with SAT. In Proc. of CAV'02, volume 2404 of LNCS, pages 209-222. Springer-Verlag, 2002.
79. S. Tripakis and S. Yovine. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design, 18(l):25-68, 2001.
80. J. Tsai, S. Yang, and Y. Chang. Timing constraint Petri nets and their application to schedulability analysis of real-time system specifications. IEEE Trans, on Software Eng., 21(l):32-49, 1995.
81. W. van der Aalst. Interval timed coloured Petri nets and their analysis. In Proc. of ICATPN'93, volume 961 of LNCS, pages 452-472. Springer-Verlag, 1993.
82. I. B. Virbitskaite and E. A. Pokozy. A partial order method for the verification of Time Petri Nets. In Fundamental of Computation Theory, volume 1684 of LNCS, pages 547-558. Springer-Verlag, 1999.
83. B. Walter. Timed Petri nets for modelling and analysing protocols with real-time characteristics. In Proc. of the 3rd IFIP Workshop on Protocol Specification, Testing, and Verification, pages 149-159. North Holland, 1983.
84. F. Wang. Region Encoding Diagram for fully symbolic verification of real-time systems. In Proc. of the 24th Int. Computer Software and Applications Conf. (COMPSAC'00), pages 509-515. IEEE Comp. Soc. Press, October 2000.
85. F. Wang. Verification of Timed Automata with BDD-like data structures. In Proc. of VMCAI'03, volume 2575 of LNCS, pages 189-205. Springer-Verlag, 2003.
86. B. Wozna, A. Zbrzezny, and W. Penczek. Checking reachability properties for Timed Automata via SAT. Fundamenta Informaticae, 55(2):223-241, 2003.
87. M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition systems. In Proc. of CAV'93, volume 697 of LNCS, pages 210-224. SpringerVerlag, 1993.
88. W. Yi, P. Pettersson, and M. Daniels. Automatic verification of real-time communicating systems by constraint-solving. In Proc. of the 7th IFIP WG6.1 Int. Conf. on Formal Description Techniques (FORTE'94), volume 6 of IFIP Conference Proceedings, pages 243-258. Chapman' & Hall, 1994.
89. T. Yoneda and H. Ryuba. CTL model checking of Time Petri Nets using geometric regions. IEICE Trans. Inf. and Syst., 3:1-10, 1998.
90. T. Yoneda and B. H. Schlingloff. Efficient verification of parallel real-time systems. Formal Methods in System Design, 11(2):197-215, 1997.
91. S. Yovine. KRONOS: A verification tool for real-time systems. Springer International Journal of Software Tools for Technology Transfer, 1(1/2):123-133, 1997.
92. A. Zbrzezny. Improvements in SAT-based reachability analysis for Timed Automata. Fundamenta Informaticae, 2004. to appear.
93. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in a boolean satisfiability solver. In Proc. of Int. Conf. on Computer-Aided Design (ICCAD'01), pages 279-285, 2001.