Regular inference for state machines using domains with equality tests

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

Volumn 4961 LNCS, Issue , 2008, Pages 317-331

  Berg, Therese ^a   Jonsson, Bengt ^a   Raffelt, Harald ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION; CONTOUR FOLLOWERS; FINITE AUTOMATA; LEARNING ALGORITHMS; SOFTWARE ENGINEERING; STATE SPACE METHODS; TESTING;

COMMUNICATION PROTOCOLS; CONFERENCES (CHEMICAL INDUSTRY); DATA DOMAINS; EUROPEAN; FINITE STATE MACHINE (FSM); FINITE STATES; HEIDELBERG (CO); INFERENCE TECHNIQUES; INFINITE STATE SPACE; INFINITE STATE SYSTEMS; INFINITE STATES; INPUT AND OUTPUT (I/O); INPUT STRINGS; INPUT/OUTPUT BEHAVIORS; INTERNATIONAL (CO); INTERNATIONAL CONFERENCES; MEALY MACHINES; MESSAGE PARAMETERS; SECOND PHASE; STATE MACHINES; STATE VARIABLES; TWO PHASES; UNBOUNDED DOMAINS;

INFERENCE ENGINES;

EID: 47249155318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78743-3_24     Document Type: Conference Paper

References (23)

1. Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol. 3472. Springer, Heidelberg (2005)
2. th ACM Symp. on Principles of Programming Languages, pp. 1-3 (2002)
3. th ACM Symp. on Principles of Programming Languages, pp. 58-70 (2002)
4. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87-106 (1987)
5. Balcázar, J., Díaz, J., Gavaldá, R.: Algorithms for learning finite automata from queries: A unified view. In: Advances in Algorithms, Languages, and Complexity, pp. 53-72. Kluwer Academic Publishers, Dordrecht (1997)
6. Dupont, P.: Incremental regular inference. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol. 1147, pp. 222-237. Springer, Heidelberg (1996)
7. Gold, E.M.: Language identification in the limit. Information and Control 10, 447-474 (1967)
8. Kearns, M., Vazirani, U.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)
9. Rivest, R., Schapire, R.: Inference of finite automata using homing sequences. Information and Computation 103, 299-347 (1993)
10. Trakhtenbrot, B.A., Barzdin, J.M.: Finite automata: behaviour and synthesis. North-Holland, Amsterdam (1973)
11. Hagerer, A., Hungar, H., Niese, O., Steffen, B.: Model generation by moderated regular extrapolation. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 80-95. Springer, Heidelberg (2002)
12. th Int. Conf. on Computer Aided Verification (2003)
13. Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Formal Methods for Protocol Engineering and Distributed Systems, FORTE/PSTV, Beijing, China, pp. 225-240. Kluwer Academic Publishers, Dordrecht (1999)
14. Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 357-370. Springer, Heidelberg (2002)
15. Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol. 3922, pp. 107-121. Springer, Heidelberg (2006)
16. th ACM Symp. on Principles of Programming Languages, pp. 184-193 (1986)
17. Jonsson, B., Parrow, J.: Deciding bisimulation equivalences for a class of non-finite-state programs. Information and Computation 107(2), 272-302 (1993)
18. Niese, O.: An integrated approach to testing complex systems. Technical report, Dortmund University, Doctoral thesis (2003)
19. Cobleigh, J.M., Giannakopoulou, D., Pasareanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331-346. Springer, Heidelberg (2003)
20. th ACM Symp. on Principles of Programming Languages, pp. 4-16 (2002)
21. Li, K., Groz, R., Shahbaz, M.: Integration testing of distributed components based on learning parameterized I/O models. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229, pp. 436-450. Springer, Heidelberg (2006)
22. Shahbaz, M., Li, K., Groz, R.: Learning and integration of parameterized components through testing. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) TestCom/FATES 2007. LNCS, vol. 4581, pp. 319-334. Springer, Heidelberg (2007)
23. Kohavi, Z.: Switching and Finite Automata Theory: Computer Science Series. McGraw-Hill Higher Education (1990)