-
Recent
- The UNIX file system as a recursive function
- Apple’s A5 chip made in Austin
- Richard Stallman speaks
- Dennis Ritchie
- Droning on about computer security
- The multics file system
- Fukushima Robot Blog
- Sinking in too many layers
- Computer architecture, power, and PHP
- VCs bailing on signed term sheets
- American corporate management
- Apple’s Patents possibly covering android
- Computer Science 101
- Why computers are more and more devices for generating heat from electricity
- Dutch masters
Tag Archives: process algebra
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 automata, milner, non-determinism, process algebra
Leave a comment
Process Algebra and classical automata
The long awaited process algebra paper is now finally available in PDF Reducing Process Algebra.
Posted in software engineering, specification
Tagged automata, automata products, classical automata, milner, process algebra
Leave a comment
Process algebra (updated)
The first part of a critique of process algebra is below. This relates to the Recursion and State paper and explicatory blog entry where I show how to compose classical automata and define them “abstractly” and to a complaint about … Continue reading
Posted in specification
Tagged automata, critique of process algebra, process algebra
Leave a comment