Computer Science – Logic in Computer Science
Scientific paper
2009-11-10
EPTCS 8, 2009, pp. 1-15
Computer Science
Logic in Computer Science
Scientific paper
10.4204/EPTCS.8.1
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.
Aceto Luca
Ingolfsdottir Anna
Sack Joshua
No associations
LandOfFree
Characteristic Formulae for Fixed-Point Semantics: A General Framework does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Characteristic Formulae for Fixed-Point Semantics: A General Framework, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characteristic Formulae for Fixed-Point Semantics: A General Framework will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-51191