TY  - JOUR
EP  - 205
N2  - 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.
TI  - Counterpart Semantics for a Second-Order mu-Calculus
SN  - 1875-8681
VL  - 118
PB  - IOS Press
A1  - Gadducci, Fabio
A1  - Lluch-Lafuente, Alberto
A1  - Vandin, Andrea
UR  - http://iospress.metapress.com/content/G154233H0U87Q571
IS  - 1-2
JF  - Fundamenta Informaticae
Y1  - 2012///
AV  - none
KW  - Quantified ?-calculi
KW  -  counterpart semantics
KW  -  modal logics
KW  -  graph transformation 
SP  - 177
ID  - eprints1049
ER  -