Tag Archives: milner

Process algebra reconsidered

Friday, May 7th, 2010

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, [...]

Filed in specification, theoretical computer science | Also tagged , , | Permalink | Comments (0)

Process Algebra and classical automata

Sunday, November 1st, 2009

The long awaited process algebra paper is now finally available in PDF Reducing Process Algebra. 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

Filed in software engineering, specification | Also tagged , , , | Permalink | Comments (0)