INFINITY 2003 Preliminary Version A Symbolic Procedure for Control Reachability in the Asynchronous -calculus

Abstract

We study the relationship between the asynchronous -calculus and the specication language MSRNC combining multiset rewriting over rst-order atomic formulas (MSR) and name constraints (NC) proposed in [10]. We exploit this connection to de ne a sound and fully automatic procedure for attacking control reachability for in nite-state specications given in asynchronous -calculus, i.e., for specications of mobile processes with unbounded control, name generation, and name mobility.