Browse by author
Lookup NU author(s): Dr Victor Khomenko
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
We show that the problems of checking pi-Calculus structural congruence (piSC) and graph isomorphism (GI) are Karp reducible to each other. The reduction from GI to piSC is given explicitly, and the reduction in the opposite direction proceeds by transforming piSC into an instance of the term equality problem (i.e. the problem of deciding equivalence of two terms in the presence of associative and/or commutative operations and commutative variable-binding quantifiers), which is known to be Karp reducible to GI. Our result is robust in the sense that it holds for several variants of structural congruence and some rather restrictive fragments of pi-Calculus. Furthermore, we address the question of solving piSC in practice, and describe a number of optimisations exploiting specific features of pi-Calculus terms, which allow one to significantly reduce the size of the resulting graphs that have to be checked for isomorphism.
Author(s): Khomenko V, Meyer R
Editor(s): Edwards, S., Lorenz, R., Vogler, W.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 9th International Conference on Application of Concurrency to System Design (ACSD)
Year of Conference: 2009
Pages: 70-79
Publisher: IEEE Computer Society
URL: http://dx.doi.org/10.1109/ACSD.2009.8
DOI: 10.1109/ACSD.2009.8
Notes: ACSD 2009.
Library holdings: Search Newcastle University Library for this item
ISBN: 9780769536972
