id: 02197511
dt: a
an: 02197511
au: Berger, Martin
ti: Basic theory of reduction congruence for two timed asynchronous
    $π$-calculi.
so: Gardner, Philippa (ed.) et al., CONCUR 2004 ‒ concurrency theory. 15th
    international conference, London, UK, August 31 ‒ September 3, 2004.
    Proceedings. Berlin: Springer (ISBN 3-540-22940-X/pbk). Lecture Notes
    in Computer Science 3170, 115-130 (2004).
py: 2004
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/b100113
ab: Summary: We study reduction congruence, the most widely used notion of
    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 semantics-preserving way.
rv: