%0 Journal Article
%@ 1875-8681
%A Gadducci, Fabio
%A Lluch-Lafuente, Alberto
%A Vandin, Andrea
%D 2012
%F eprints:1049
%I IOS Press
%J Fundamenta Informaticae
%K Quantified μ-calculi, counterpart semantics, modal logics, graph transformation 
%N 1-2
%P 177-205
%T Counterpart Semantics for a Second-Order mu-Calculus
%U http://eprints.imtlucca.it/1049/
%V 118
%X Quantified μ-calculi combine the fix-point and modal operators of temporal logics with (existential and universal) quantifiers, and they allow for reasoning about the possible behaviour of individual components within a software system. In this paper we introduce a novel approach to the semantics of such calculi: we consider a sort of labeled transition systems called counterpart models as semantic domain, where states are algebras and transitions are defined by counterpart relations (a family of partial homomorphisms) between states. Then, formulae are interpreted over sets of state assignments (families of partial substitutions, associating formula variables to state components). Our proposal allows us to model and reason about the creation and deletion of components, as well as the merging of components. Moreover, it avoids the limitations of existing approaches, usually enforcing restrictions of the transition relation: the resulting semantics is a streamlined and intuitively appealing one, yet it is general enough to cover most of the alternative proposals we are aware of. The paper is rounded up with some considerations about expressiveness and decidability aspects.