A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We study reduction congruence, a popular notion of process equality, for the asynchronous π-calculus with timers, and derive several alternative characterisations, one of them being a labelled asynchronous bisimilarity. These results are adapted to an asynchronous π-calculus with timers, locations and message failure. In addition we investigate the problem of how to distribute value-passing processes in a semanticspreserving way.doi:10.1007/978-3-540-28644-8_8 fatcat:s3dkfs5t6vg77oikujiilz3yyq