-
Recent
- Timestamp based reconciliation
- Murdoch strikes against copyrights
- Loose cables at CERN and Time synchronization is hard
- Manufacturing and devices
- Julia programming language and hadoop
- 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
Tag Archives: automata
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
The source of error (updated)
Here’s Edsger Dijkstra discussing the birth of the use of axiomatics in computer science – the start of “formal methods” research. What’s striking is the assumed choice between “axiomatic” and “mechanistic” as if there was no other way. In a … Continue reading
Posted in specification
Tagged automata, axiomatic methods, dijkstra, formal methods
Leave a comment