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 fi nal state, a system may interact with another system. This is needed in order to describe parallel or distributed systems, [...]
Bookmark on Delicious Digg this post Recommend on Facebook Share on Linkedin share via Reddit Tweet about it Subscribe to the comments on this post
Here’s a graph of a simple state machine of somewhat under 512 states that models a dumb fifo queue. The initial state is “e” for empty. We can append 1,2 or 3 to this queue and can delete the first in. To simplify suppose the alphabet is {0,1,2,3} where 0 means “dequeue” and the others [...]