@article{eprints361,
       publisher = {Elsevier},
           pages = {34--52},
            note = {An extended abstract of this paper appears in: B. Jonsson and J. Parrow (eds.), Proceedings of CONCUR'94, Lectures Notes in Computer Science 836, Springer-Verlag, 1994.},
          number = {1},
          volume = {126},
         journal = {Information and Computation},
            year = {1996},
          author = {Michele Boreale and Rocco De Nicola},
           title = {A Symbolic Semantics for the pi-Calculus},
        abstract = {We use symbolic transition systems as a basis for providing the{\ensuremath{\pi}}-calculus with an alternative semantics. The latter is more amenable to automatic manipulation and sheds light on the logical differences among different forms of bisimulation over algebras of name-passing processes. Symbolic transitions have the form[formula], where{\ensuremath{\phi}}is a boolean combination of equalities on names that has to hold for the transition to take place, and{\ensuremath{\alpha}}is standard a{\ensuremath{\pi}}-calculus action. On top of the symbolic transition system, a symbolic bisimulation is defined that captures the standard ones. Finally, a sound and complete proof system is introduced for symbolic bisimulation.},
             url = {http://eprints.imtlucca.it/361/}
}