Learning of event-recording automata

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

Volumn 3253, Issue , 2004, Pages 379-395

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

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; REAL TIME SYSTEMS; TIME SHARING SYSTEMS;

EQUIVALENCE QUERIES; HYPER-CUBES; MEMBERSHIP QUERY; ONLINE LEARNING; S-ALGORITHMS; TIMED SYSTEMS; TIMING CONSTRAINTS; UNDERLYING SYSTEMS;

LEARNING ALGORITHMS;

EID: 35048884226     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30206-3_26     Document Type: Article

References (26)

1. R. Alur. Timed automata. In Proc. 11th International Computer Aided Verification Conference, LNCS 1633, p. 8-22. Springer, 1999.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, L. Fix, and T. Henzinger. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science, 211:253-273, 1999.
4. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
5. 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, p. 53-72. Kluwer, 1997.
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. In R. Alur, T. A. Henzinger, and E. D. Sontag, editors, Hybrid Systems III, LNCS 1066, p. 232-243. Springer, 1996.
7. P. Bouyer. Untameable timed automata. In H. Alt and M. Habib, editors, Symp. on Theoretical Aspects of Computer Science, LNCS 2607. Springer, 2003.
8. 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. 10th International Conference on Computer Aided Verification, Vancouver, Canada, LNCS 1427, p. 546-550. Springer, 1998.
9. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, Dec. 1999.
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. In J. Sifakis, editor, Automatic Verification Methods for Finite-State Systems, LNCS 407. Springer, 1989.
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:447-474, 1967.
14. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, LNCS 2280. Springer, 2002.
15. th Int. Conf. on Fundamental Approaches to Software Engineering, LNCS 2306, p. 80-95. Springer, 2002.
16. 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.
17. T. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for timed transition systems. Information and Computation, 112:173-337, 1994.
18. th International Colloquium on Automata, Lnaguages, and Programming, LNCS 1443, p. 580-591. Springer, 1998.
19. th Int. SPIN Workshop, LNCS 1885, p. 131-147, Stanford, CA, 2000. Springer.
20. th Int. Conf. on Computer Aided Verification, 2003.
21. M. Kearns and U. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
22. O. Maler and A. Pnueli. On recognizable timed languages. In Proc. FOSSACS04, Conf. on Foundations of Software Science and Computation Structures, LNCS. Springer, 2004. Available from http://www-verimag.imag.fr/PEOPLE/Oded. Maler/.
23. R. Rivest and R. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103:299-347, 1993.
24. 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.
25. J. Springintveld and F. Vaandrager. Minimizable timed automata. In B. Jonsson and J. Parrow, editors, Proc. FTRTFT'96, Formal Techniques in Real-Time and Fault-Tolerant Systems, Uppsala, Sweden, LNCS 1135, p. 130-147. Springer, 1996.
26. 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, Formal Techniques in Real-Time and Fault-Tolerant Systems, Lübeck, Germany, LNCS 863, p. 694-715. Springer, 1994.