 
Summary: Under consideration for publication in Math. Struct. in Comp. Science
Characteristic Formulae for FixedPoint
Semantics: A General Framework
LUCA ACETO1
ANNA INGOLFDOTTIR1
PAUL BLAIN LEVY2
JOSHUA SACK1
1
School of Computer Science, Reykjavik University, IS101 Reykjav´ik, Iceland
2
University of Birmingham, Birmingham B15 2TT, UK
Received 18 August 2010
The literature on concurrency theory offers a wealth of examples of characteristicformula
constructions for various behavioural relations over finite labelled transition systems and
Kripke structures that are defined in terms of fixed points of suitable functions. Such
constructions and their proofs of correctness have been developed independently, but
have a common underlying structure. This study provides a general view of characteristic
formulae that are expressed in terms of logics with a facility for the recursive definition
of formulae. It is shown how several examples of characteristicformula constructions
from the literature can be recovered as instances of the proposed general framework, and
