Robin Milner’s book Communication and Concurrency involves a take on state machines that is fundamentally incorrect. “Now in standard automata theory, an automaton is interpreted as a language i.e. as a set of strings over the alphabet.“ That’s not at
Process algebra reconsidered
Paper is here. The following incorrect claim is not unusual in the process algebra literature. Basically, what is missing [in classical automata theory] is the notion of interaction: during the execution from initial state to final state, a system may
Process Algebra and classical automata
The long awaited process algebra paper is now finally available in PDF Reducing Process Algebra.