Skip to main content

Why Automata Models Are Sexy for Testers? (Invited Talk)

  • Conference paper
Perspectives of Systems Informatics (PSI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4378))

  • 554 Accesses

Abstract

Formal methods traditionally aim at verifying and proving correctness (a typical academic activity), while testing can only show the presence of errors (that is what practitioners do). Recently, there is an increasing interest in the use of formal models and methods in testing. In this talk, we first present a traditional framework of model–based testing, considering a variety of state-oriented (automata) models, such as Finite State Machines (FSM), Communicating FSM, Extended FSM, where input and output are coupled for each transition; and input/output automata (a.k.a. transition systems), where inputs are outputs are decoupled. We provide an overview of existing test derivation techniques based on automata models, while paying a special attention to the underlying testing assumptions and fault detection capability of the resulting tests.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Editor information

Irina Virbitskaite Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petrenko, A. (2007). Why Automata Models Are Sexy for Testers? (Invited Talk). In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70881-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70880-3

  • Online ISBN: 978-3-540-70881-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics