A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
A remarkable result in  shows that in spite of its being less expressive than CCS w.r.t. weak bisimilarity, CCS ! (a CCS variant where infinite behavior is specified by using replication rather than recursion) is Turing powerful. This is done by encoding Random Access Machines (RAM) in CCS ! . The encoding is said to be non-faithful because it may move from a state which can lead to termination into a divergent one which do not correspond to any configuration of the encoded RAM. I.e., thedoi:10.1007/978-3-540-76637-7_26 fatcat:wljwhmgttzcqzin7n34v6c66ee