Automatic verification of multi-queue discrete Timed Automata

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

Volumn 2697, Issue , 2003, Pages 159-171

  San Pietro, Pierluigi ^a   Dang, Zhe ^b  

^a POLITECNICO DI MILANO   (Italy)

^b Washington State University   (United States)

Author keywords

Infinite state model checking; Real time systems; Timed Automata

Indexed keywords

AUTOMATA THEORY; INTERACTIVE COMPUTER SYSTEMS; LIME; MODEL CHECKING; QUEUEING THEORY; ROBOTS;

AUTOMATIC VERIFICATION; INFINITE STATE; INFINITE STATE MODEL CHECKING; REACHABILITY; REAL-TIME SCHEDULERS; SEMILINEAR; TIMED AUTOMATA; UNBOUNDED QUEUES;

REAL TIME SYSTEMS;

EID: 33645209803     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_18     Document Type: Article

References (21)

1. P. Abdulla and B. Jonsson. Model checking of systems with many identical timed processes. Theoretical Computer Science, 290(1):241-264, 2002.
2. P. Abdulla and A. Nylén. Timed petri nets and bqos. In ICATPN'2001, 22nd Int. Conf. on application and theory of Petri nets, 2001.
3. R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, May 1993.
4. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, April 1994.
5. M. Benedikt P. Godefroid and T. Reps. Model checking of unrestricted hierarchical state machines. In ICALP 2001, of LNCS 2076, pp. 652-666. Springer, 2001.
6. L. Breveglieri, A. Cherubini, C. Citrini, and S. Crespi Reghizzi. Multiple pushdown languages and grammars. Int. Journal of Found. of Computer Science, 7:253-291, 1996.
7. L. Breveglieri, A. Cherubini, and S. Crespi Reghizzi. Real-time scheduling by queue automata. In FTRTFT'92, vol/ 571 of LNCS, pages 131-148. Springer, 1992.
8. L. Breveglieri, A. Cherubini, and S. Crespi Reghizzi. Modelling operating systems schedulers with multi-stack-queue grammars. In Fundamentals of Computation Theory, volume 1684 of LNCS, pages 161-172. Springer, 1999.
9. G. Cece and A. Finkel. Programs with quasi-stable channels are effectively recognizable. In CAV'97, volume 1254 of LNCS, pages 304-315. Springer, 1997.
10. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In CAV'98, volume 1427 of LNCS, pages 268-279. Springer, 1998.
11. H. Comon and Y. Jurski. Timed automata and the theory of real numbers. In CONCUR'99, volume 1664 of LNCS, pages 242-257. Springer, 1999.
12. Zhe Dang. Binary reachability analysis of pushdown timed automata with dense clocks. In CAV'01, volume 2102 of LNCS, pages 506-517. Springer, 2001.
13. Zhe Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer, and J. Su. Binary reachability analysis of discrete pushdown timed automata. In CAV'00, LNCS 1855, pages 69-84. Springer, 2000.
14. S. Ginsburg and E. Spanier. Semigroups, presburger formulas, and languages. Pacific J. of Mathematics, 16:285-296, 1966.
15. P. Godefroid and R. Jagadeesan. Automatic abstraction using generalized model checking. In CAV'02, volume 2404 of LNCS, pages 137-150. Springer, 2002.
16. B. Grahlmann. The state of pep. In AMST'98, LNCS 1548, pages 522-526. Springer, 1998.
17. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, June 1994.
18. R. Parikh. On context-free languages. Journal of the ACM, 13:570-581, 1966.
19. A. Pnueli and E. Shahar. Livenss and acceleraiton in parameterized verification. In CAV'00, volume 1855 of LNCS. Springer, 2000.
20. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 35(8):102-114, 1992.
21. B. Steffen and O.Burkart. Model checking the full modal mu-calculus for infinite sequential processes. In ICALP'97, volume 1256 of LNCS, pages 419-429.