Category Archives: theoretical computer science

mathematical work relating to computer science and automata.

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 fi nal state, a system may … Continue reading

Posted in specification, theoretical computer science | Tagged , , , | Leave a comment

More state diagrams

Posted in software engineering, specification, theoretical computer science | Tagged | Leave a comment

limits of state diagrams

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 … Continue reading

Posted in academics, architecture, specification, theoretical computer science | Leave a comment