DIMACS Theory Lunch Seminar


Title:

Testing Finiate State Systems

Speaker:

Mihalis Yannakakis
AT&T Bell Labs

Place:

Room 402, Computer Science Building
Princeton University

Time:

Lunch 11:45 AM, Talk 12 Noon
Friday, February 16, 1996

Abstract:

Finite state machines have been used to model a wide variety of systems, including sequential circuits, and more recently, communication protocols. In testing problems we are given a machine M, which we may test by providing inputs and observing the outputs produced. The goal is to design test sequences so that we can deduce desired information, such as the state of M (distinguishing test), or whether M implements correctly a given specification machine S (conformance test). In this talk we will discuss algorithmic work on basic testing problems for different types of finite state machines.

To get yourself added to this mailing list, send mail to majordomo@cs.princeton.edu with one line in the message: subscribe theory-read.

To get yourself removed from the mailing list, send mail to majordomo@cs.princeton.edu with one line in the message: unsubscribe theory-read.


dimacs-www@dimacs.rutgers.edu
Document last modified on February 9, 1996