Inference of timed transition systems

Electronic Notes in Theoretical Computer Science

Volumn 138, Issue 3, 2005, Pages 87-99

  Grinchtein, Olga ^a   Jonsson, Bengt ^a   Leucker, Martin ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Model inference; Model learning; Timed systems

Indexed keywords

AUTOMATA THEORY; FORMAL LANGUAGES; GRAPH THEORY; LEARNING SYSTEMS; POLYNOMIALS; QUERY LANGUAGES;

INFERRING SYSTEMS; MODEL INFERENCE; MODEL LEARNING; TIMED SYSTEMS;

ONLINE SYSTEMS;

EID: 29144483527     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.02.062     Document Type: Conference Paper

References (28)

1. R. Alur Timed automata Proc. 11th International Computer Aided Verification Conference Lecture Notes in Computer Science volume 1633 1999 Springer-Verlag 8 22
2. R. Alur, and D. Dill A theory of timed automata Theoretical Computer Science 126 1994 183 235
3. R. Alur, L. Fix, and T. Henzinger Event-clock automata: A determinizable class of timed automata Theoretical Computer Science 211 1999 253 273
4. D. Angluin Learning regular sets from queries and counterexamples Information and Computation 75 1987 87 106
5. J.L. Balcázar, J. Díaz, and R. Gavaldá Algorithms for learning finite automata from queries: A unified view Advances in Algorithms, Languages, and Complexity 1997 Kluwer 53 72
6. J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson, and W. Yi UPPAAL: a tool suite for the automatic verification of real-time systems R. Alur T.A. Henzinger E.D. Sontag Hybrid Systems III Lecture Notes in Computer Science volume 1066 1996 Springer-Verlag 232 243
7. P. Bouyer Untameable timed automata H. Alt M. Habib Symp. on Theoretical Aspects of Computer Science Lecture Notes in Computer Science volume 2607 2003 Springer Verlag 620 631
8. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine Kronos: A model-checking tool for real-time systems A.J. Hu M.Y. Vardi Proc. 10th International Conference on Computer Aided Verification, Vancouver, Canada Lecture Notes in Computer Science volume 1427 1998 Springer-Verlag 546 550
9. E. Clarke, O. Grumberg, and D. Peled Model Checking Dec. 1999 MIT Press
10. 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
11. D. Dill Timing assumptions and verification of finite-state concurrent systems J. Sifakis Automatic Verification Methods for Finite-State Systems Lecture Notes in Computer Science volume 407 1989 Springer Verlag
12. 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
13. E.M. Gold Language identification in the limit Information and Control 10 1967 447 474
14. O. Grinchtein, B. Jonsson, and M. Leucker. Learning of event-recording automata. In Proceedings of the Joint Conferences FORMATS and FTRTFT, Lecture Notes in Computer Science, Sept. 2004. to appear
15. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems Lecture Notes in Computer Science volume 2280 2002 Springer Verlag 357 370
16. th Int. Conf. on Fundamental Approaches to Software Engineering Lecture Notes in Computer Science volume 2306 2002 Springer Verlag 80 95
17. D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, A. Shtull-Trauring, and M. Trakhtenbrot STATEMATE: A working environment for the development of complex reactive systems IEEE Trans. on Software Engineering 16 4 April 1990 403 414
18. T. Henzinger, Z. Manna, and A. Pnueli Temporal proof methodologies for timed transition systems Information and Computation 112 1994 173 337
19. th International Colloquium on Automata, Lnaguages, and Programming Lecture Notes in Computer Science volume 1443 1998 Springer Verlag 580 591
20. th Int. SPIN Workshop Lecture Notes in Computer Science volume 1885 2000 Springer Verlag 131 147 Stanford, CA
21. th Int. Conf. on Computer Aided Verification, 2003
22. M. Kearns, and U. Vazirani An Introduction to Computational Learning Theory 1994 MIT Press
23. O. Maler, and A. Pnueli On recognizable timed languages Proc. FOSSACS04, Conf. on Foundations of Software Science and Computation Structures Lecture Notes in Computer Science 2004 Springer-Verlag
24. Available from http://www-verimag.imag.fr/PEOPLE/Oded.Maler/
25. R. Rivest, and R. Schapire Inference of finite automata using homing sequences Information and Computation 103 1993 299 347
26. 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'2000, June 2000
27. J. Springintveld, and F. Vaandrager Minimizable timed automata B. Jonsson J. Parrow Proc. FTRTFT'96, Formal Techniques in Real-Time and Fault-Tolerant Systems, Uppsala, Sweden Lecture Notes in Computer Science volume 1135 1996 Springer Verlag 130 147
28. T. Wilke Specifying timed state sequences in powerful decidable logics and timed automata H. Langmaack W.P. de Roever J. Vytopil Proc. FTRTFT'94, Formal Techniques in Real-Time and Fault-Tolerant Systems, Lübeck, Germany Lecture Notes in Computer Science volume 863 1994 Springer Verlag 694 715