Towards Efficient Partition Refinement for Checking Reachability in Timed Automata

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

Volumn 2791, Issue , 2004, Pages 2-17

  Półrola, Agata ^a   Penczek, Wojciech ^b   Szreter, Maciej ^c  

^a UNIVERSITY OF LODZ   (Poland)

^b INSTITUTE OF COMPUTER SCIENCE   (Poland)

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

Author keywords

[No Author keywords available]

Indexed keywords

TIME SHARING SYSTEMS;

ABSTRACT MODELS; ON THE FLIES; PARTITION REFINEMENT; PARTITIONING ALGORITHMS; REACHABILITY; REACHABILITY ANALYSIS; REACHABILITY GRAPHS; TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 35048888927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40903-8_2     Document Type: Article

References (23)

1. R. Alur, G. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In Proc. of the 13th IEEE Real-Time Systems Symposium (RTSS'92), pages 157-166. IEEE Comp. Soc. Press, 1992.
2. R. Alur, G. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In Proc. of the Int. Conf. on Concurrency Theory (CONCUR'92), volume 630 of LNCS, pages 340-354. Springer-Verlag, 1992.
3. G. Audemard, A. Cimatti, A. Kornilowicz, and R. Sebastiani. Bounded model checking for timed systems. Technical Report 0201-05, ITC-IRST, Sommarive 16, 38050 Povo, Trento, Italy, January 2002.
4. D. Beyer. Improvements in BDD-based reachability analysis of Timed Automata. In Proc. of Int. Symp. of Formal Methods Europe (FME'01), volume 2021 of LNCS, pages 318-343. Springer-Verlag, 2002.
5. A. Bouajjani, J-C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. Science of Computer Programming, 18:247-269, 1992.
6. A. Bouajjani, S. Tripakis, and S. Yovine. On-the-fly symbolic model checking for real-time systems. In Proc. of the 18th IEEE Real-Time Systems Symposium (RTSS'97), pages 232-243. IEEE Comp. Soc. Press, 1997.
7. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reachability analysis of probabilistic systems by successive refinements. In Proc. of Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV), volume 2165 of LNCS, pages 39-56. Springer-Verlag, 2001.
8. C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In Proc. of the 4th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), volume 1384 of LNCS, pages 313-329. Springer-Verlag, 1998.
9. P. Dembiński, A. Janowska, P. Janowski, W. Penczek, A. Półrola, M. Szreter, B. Woźna, and A. Zbrzezny. VerICS: A tool for verifying Timed Automata and Estelle specifications. In Proc. of the 9th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), volume 2619 of LNCS, pages 278-283. Springer-Verlag, 2003.
10. P. Dembiński, W. Penczek, and A. Półrola. Automated verification of infinite state concurrent systems: an improvement in model generation. In Proc. of the 4th Int. Conf. on Parallel Processing and Applied Mathematics (PPAM'01), volume 2328 of LNCS, pages 247-255. Springer-Verlag, 2002.
11. P. Dembiński, W. Penczek, and A. Półrola. Verification of Timed Automata based on similarity. Fundamenta Informaticae, 51(1-2):59-89, 2002.
12. T. Henzinger and R. Majumdar. A classification of symbolic transition systems. In Proc. of the 17th Int. Symp. on Theoretical Aspects of Computer Science (STAGS'00), volume 1770 of LNCS, pages 13-34. Springer-Verlag, 2000.
13. 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.
14. 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 the 18th IEEE Real-Time System Symposium (RTSS'97), pages 14-24. IEEE Comp. Soc. Press, 1997.
15. 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.
16. P. Niebert, S. Tripakis, and S. Yovine. Minimum-time reachability for Timed Automata. In Proc. of the 8th IEEE Mediterranean Conf. on Control and Automation (MED'2000), Patros, Greece, July 2000. IEEE Comp. Soc. Press.
17. W. Penczek. Partial order reductions for checking branching properties of Time Petri Nets. In Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P'00), volume 140 of Informatik-Berichte, pages 189-202. Humboldt University, 2000.
18. A. Półrola, W. Penczek, and M. Szreter. Towards efficient partition refinement for checking reachability in Timed Automata. An electronic version of this paper, available at http://www.math.uni.lodz.pl/~polrola.
19. A. Półrola, W. Penczek, and M. Szreter. Reachability analysis for Timed Automata based on partitioning. Technical Report 961, ICS PAS, Ordona 21, 01-237 Warsaw, June 2003.
20. S. Tripakis and S. Yovine. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design, 18(1):25-68, 2001.
21. B. Woźna, W. Penczek, and A. Zbrzezny. Checking reachability properties for Timed Automata via SAT. Technical Report 949, ICS PAS, Ordona 21, 01 - 237 Warsaw, October 2002.
22. M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition systems. In Proc. of the 5th Int. Conf. on Computer Aided Verification (CAV'93), volume 697 of LNCS, pages 210-224. Springer-Verlag, 1993.
23. 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.