A classical automata approach to noninterference type problems

Abstract

Using classical automata theory the authors show how noninterference can be viewed as a relatively simple phenomenon. They also give direction for future work concerning probabilistic security problems using classical automata theory.<>