db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"<br>
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"<br>
@InProceedings{Peschansk04,
  title =        "{O}n {L}inear {T}ime and {C}ongruence in {C}hannel-{P}assing {C}alculi",
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"<br>
  author=        "Peschanski,  Frederic",
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"<br>
  editor=        "East, Ian R. and Duce, David and Green, Mark and Martin,  Jeremy M. R. and Welch, Peter H.",
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"<br>
  pages =        "39--54",
  booktitle=     "{C}ommunicating {P}rocess {A}rchitectures 2004",
  isbn=          "1 58603 458 8",
  year=          "2004",
  month=         "sep",
  abstract=      "Process algebras such as CSP or the Pi-calculus are theories
     to reason about concurrent software. The Pi-calculus also
     introduces channel passing to address specific issues in
     mobility. Despite their similarity, the languages expose
     salient divergences at the formal level. CSP is built upon
     trace semantics while labelled transition systems and
     bisimulation are the privileged tools to discuss the
     Pi-calculus semantics. In this paper, we try to bring closer
     both approaches at the theoretical level by showing that
     proper trace semantics can be built upon the Pi-calculus.
     Moreover, by introducing locations, we obtain the same
     discriminative power for both the trace and bisimulation
     equivalences, in the particular case of early semantics. In
     a second part, we propose to develop the semantics of a
     slightly modified language directly in terms of traces. This
     language retains the full expressive power of the
     Pi-calculus and most notably supports channel passing.
     Interestingly, the resulting equivalence, obtained from late
     semantics, exhibits a nice congruence property over process
     expressions."
}