Inference of event-recording automata using timed decision trees

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

Volumn 4137 LNCS, Issue , 2006, Pages 435-449

  Grinchtein, Olga ^a   Jonsson, Bengt ^a   Pettersson, Paul ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS; DATA RECORDING; DECISION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; TREES (MATHEMATICS);

DECISION TREES; EVENT-RECORDING AUTOMATA; INFERENCE; TIMED-AUTOMATON MODELS;

AUTOMATA THEORY;

EID: 33749579207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817949_29     Document Type: Conference Paper

References (25)

1. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
2. R. Alur, L. Fix, and T. Henzinger. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science, 211:253-273, 1999.
3. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
4. J. L. Balcázar, J. Díaz, and R. Gavaldá. Algorithms for learning finite automata from queries: A unified view. In Advances in Algorithms, Languages, and Complexity, pages 53-72. Kluwer, 1997.
5. J. Bengtsson, K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi. UPPAAL: a tool suite for the automatic verification of real-time systems. In R. Alur, T. A. Henzinger, and E. D. Sontag, editors, Hybrid Systems III, volume 1066 of LNCS, pages 232-243. Springer-Verlag, 1996.
6. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: A model-checking tool for real-time systems. In A. J. Hu and M. Y. Vardi, editors. Proc. CAV'98, volume 1427 of LNCS, pages 546-550. Springer-Verlag, 1998.
7. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, Dec. 1999.
8. J. Corbett, M. Dwyer, J. Hatcliff, S. Laubach, C. Pasareanu, Robby, and H. Zheng. Bandera: Extracting finite-state models from Java source code. In Proc. 22nd Int. Conf. on Software Engineering, June 2000.
9. J.-C. Fernandez, C. Jard, T. Jéron, and C. Viho. An experiment in automatic generation of test suites for protocols with verification technology. Science of Computer Programming, 29, 1997.
10. E. M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
11. O. Grinchtein, B. Jonsson, and M. Leucker. Learning of event-recording automata. In Proceedings of the Joint Conferences FORMATS and FTRTFT, volume 3253 of LNCS, Sept. 2004.
12. O. Grinchtein, B. Jonsson, and M. Leucker. Inference of timed transition systems. LNCS, 138(3):87-99, 2005.
13. A. Groce, D. Peled, and M. Yannakakis. Adaptive model checking. In Proc. TACAS'02, LNCS, 2002.
14. A. Hagerer, H. Hungar, O. Niese, and B. Steffen. Model generation by moderated regular extrapolation. In R.-D. Kutsche and H. Weber, editors, Proc. FASE02, volume 2306 of LNCS, pages 80-95. Springer Verlag, 2002.
15. D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, A. ShtullTrauring, and M. Trakhtenbrot. STATEMATE: A working environment for the development of complex reactive systems. IEEE Trans, on Software Engineering, 16(4):403-414, April 1990.
16. T. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for timed transition systems. Information and Computation, 112:173-337. 1994.
17. T. Henzinger, J.-F. Raskin, and P.-Y. Schobbens. The regular real-time languages. In K. Larsen, S. Skuym, and G. Winskel, editors, ICALP98, volume 1443 of LNCS, pages 580-591. Springer Verlag, 1998.
18. th Int. SPIN Workshop, volume 1885 of LNCS, pages 131-147, Stanford, CA, 2000. Springer Verlag.
19. H. Hangar, O. Niese, and B. Steffen. Domain-specific optimization in automata learning. In Proc. CAV'03, 2003.
20. M. Kearns and U. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
21. O. Maler and A. Pnueli. On recognizable timed languages. In Proc. FOSSACS04-,LNCS. Springer-Verlag, 2004.
22. R. Rivest and R. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103:299-347, 1993.
23. M. Schmitt, M. Ebner, and J. Grabowski. Test generation with autolink and testcomposer. In Proc. 2nd Workshop of the SDL Forum Society on SDL and MSC - SAM'8000, June 2000.
24. J. Springintveld and F. Vaandrager. Minimizable timed automata. In B. Jonsson and J. Parrow, editors, Proc. FTRTFT'96, volume 1135 of LNCS, pages 130-147. Springer Verlag, 1996.
25. T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In H. Langmaack, W. P. de Roever, and J. Vytopil, editors. Proc. FTRTFT'94, volume 863 of LNCS. pages 694-715. Springer Verlag, 1994.