Sequential functions can be used to define and compose large scale state machines that represent computer software and hardware. The mathematical basis is introduced and there are motivating examples, including a proof of the safety of the Paxos algorithm. https://www.yodaiken.com/wp-content/uploads/2023/12/fac_sm_published_acm.pdf
Recursive transducers and products – pre-submit version
Recursive transducers.
Process Algebra and classical automata
The long awaited process algebra paper is now finally available in PDF Reducing Process Algebra.
Robin Milner and Automata theory
I always had the impression that the entire group of “process algebra” people didn’t know much about automata, but this is surprising. But meanwhile I got somehow interested, and I don’t know how, in concurrency. I remember that, without linking