CONCUR 2004 START ConferenceManager    

Basic Theory of Reduction Congruence for Two Timed Asynchronous Pi-Calculi

Martin Berger

Presented at Fifteenth International Conference on Concurrency Theory (CONCUR 2004), London, England, 31 August - 3 September, 2004


This paper studies reduction congruence \cite{short:HondaK:redbps} for the asynchronous $\pi$-calculus with timers \cite{short:MartinB:twophacpiaepc} and derives several alternative characterisations, one of them being a labelled asynchronous bisimilarity. These results are generalised to an asynchronous $\pi$-calculus with timers, locations and message failure. In addition we investigate the problem of how to distribute value-passing processes in a semantics-preserving way.

START Conference Manager (V2.47.4)