A Symbolic Semantics for Abstract Model Checking [chapter]

Francesca Levi
1998 Lecture Notes in Computer Science  
We present a finite symbolic semantics of value-passing concurrent processes, that can be suitably interpreted over abstract values to compute a lower approximate semantics of full µ-calculus. The main feature of the semantics is that classical branching is replaced by explicit relations of non-deterministic and alternative choices among transitions. A combination of safe upper and lower approximations of the basic operators of the logic is used to handle negation. The relations of
more » ... stic and alternative choices turn out to be very useful for the dual approximations of the existential next modality.
doi:10.1007/3-540-49727-7_8 fatcat:zf43px7muza2dbyormuphis3tm