Characteristic Formulae for Fixed-Point Semantics: A General Framework

Luca Aceto
(Reykjavik University)
Anna Ingolfsdottir
(Reykjavik University)
Joshua Sack
(Reykjavik University)

The literature on concurrency theory offers a wealth of examples of characteristic-formula 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 characteristic-formula constructions from the literature can be recovered as instances of the proposed general framework, and how the framework can be used to yield novel constructions.

In Sibylle Fröschle and Daniele Gorla: Proceedings 16th International Workshop on Expressiveness in Concurrency (EXPRESS 2009), Bologna, Italy, 5th September 2009, Electronic Proceedings in Theoretical Computer Science 8, pp. 1–15.
Published: 17th November 2009.

ArXived at: bibtex PDF

Comments and questions to:
For website issues: