A symbolic semantics for abstract model checking

In this paper we present a symbolic semantics of value-passing concurrent processes where classical branching is replaced by separate relations of non-deterministic branch and alternative choice. The obtained symbolic graph is finite for regular processes and can suitably be interpreted over abstract values to effectively compute a safe abstract model for full μ-calculus model checking. The representation of non-determinism and alternative choice in symbolic transitions allows to achieve more precise approximations of the two dual next modalities.