Problems and Methods for Testing Infinite State Machines | Zendy

Marie-Claude Gaudel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Problems and Methods for Testing Infinite State Machines

Author(s) -

Marie-Claude Gaudel

Publication year - 2004

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.04.005

Subject(s) - finite state machine , computer science , conformance testing , extended finite state machine , state (computer science) , finite state , point (geometry) , model based testing , abstract state machines , formal methods , theoretical computer science , test case , programming language , mathematics , machine learning , geometry , regression analysis , markov chain , standardization , operating system

There has been a lot of research on testing based on formal specifications, especially in the area of communication protocols. Most approaches take as starting point some finite model of the required behaviours of the system under test, such as Finite State Machines. This paper discusses the problems that arise when the underlying model of the specification is not finite

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research