Standard Automata Theory and Process Algebra
For researchers in formal methods, this paper provides a historical perspective and argues for the relevance of classical automata theory, but it is largely a survey and argument without new results.
The paper argues that classical automata theory from the 1950s-60s is more capable for modern system specification and verification than acknowledged, and demonstrates its applicability to concurrent systems, partly by revisiting critiques from early process algebra.
Classical automata theory is far more capable of modeling complex digital systems than is widely acknowledged in the ``formal methods'' literature. This paper takes a second look at automata theory methods that were mostly developed in the 1950s and 1960s to show how they can be applied to problems of current era specification and verification of systems, including concurrent systems. The explication is partly guided by taking a second look at the critique of automata theory in early formal methods, particularly from the early process algebra literature, Since much of the classic automata theory literature is not well known anymore, the paper also provides brief historical literature survey.