## Characteristic Formulae for Fixed-Point Semantics: A General Framework (2010)

### Cached

### Download Links

Venue: | UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE |

Citations: | 3 - 1 self |

### BibTeX

@MISC{Aceto10characteristicformulae,

author = {Luca Aceto and et al.},

title = {Characteristic Formulae for Fixed-Point Semantics: A General Framework},

year = {2010}

}

### OpenURL

### Abstract

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. The paper also offers general results pertaining to the definition of co-characteristic formulae and of characteristic formulae expressed in terms of infinitary modal logics.

### Citations

3275 | Communication and Concurrency - Milner - 1989 |

1309 | A Structural Approach to Operational Semantics - Plotkin - 1981 |

1249 | The temporal logic of programs - Pnueli - 1977 |

1208 | Automatic verification of finite-state concurrent systems using temporal logic specifications - Clarke, Emerson, et al. - 1986 |

821 |
Design and synthesis of synchronization skeletons using branching-time temporal logic, in
- Clarke, Emerson
- 1981
(Show Context)
Citation Context ...ive Works License.2 Characteristic Formulae for Fixed-Point Semantics: A General Framework An alternative approach to the specification and verification of reactive systems is that of model checking =-=[7, 6, 32]-=-. In this approach, automata are still the formalism of choice for the description of the actual behaviour of a concurrent system. However, specifications of the expected behaviour of a system are now... |

671 | Concurrency and automata on infinite sequences - Park - 1981 |

544 | A lattice-theoretical fixpoint theorem and its applications - Tarski - 1955 |

499 | Algebraic laws for nondeterminism and concurrency - Hennessy, Milner - 1985 |

259 | Results on the Propositional Mu-Calculus - Kozen - 1983 |

244 | Specification and verification of concurrent systems in CESAR - Queille, Sifakis - 1982 |

196 | Bisimulation can’t be traced - Bloom, Istrail, et al. - 1995 |

191 | F.W.: Structured operational semantics and bisimulation as a congruence - Groote, Vaandrager - 1992 |

162 | Formal verification of parallel programs - Keller - 1976 |

136 |
Characterizing finite Kripke structures in propositional temporal logic
- Browne, Clarke, et al.
- 1988
(Show Context)
Citation Context ...behavioural relations over finite labelled transition systems, Kripke structures and timed automata that are defined in terms of fixed points of suitable functions. (See, for instance, the references =-=[2, 5, 8, 13, 21, 23, 28]-=-.) Such constructions and their proofs of correctness have been developed independently, but have a common underlying structure. It is therefore natural to ask oneself whether one can provide a genera... |

104 | Three logics for branching bisimulation - Nicola, Vaandrager - 1990 |

99 | The linear time-branching time spectrum I - the semantics of concrete, sequential processes - Glabbeek - 2001 |

53 | From Timed Automata to Logic – and Back - Laroussinie, Larsen - 1995 |

40 | Termination, deadlock, and divergence - Aceto, Hennessy |

32 | Relational Reasoning about Functions and Nondeterminism - Lassen - 1998 |

31 | Bounded nondeterminism and the approximation induction principle in process algebra - Glabbeek - 1987 |

28 | B.: Computing behavioural relations, logically - Cleaveland, Steffen - 1991 |

28 | On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract - Thomas - 1993 |

21 |
Graphical versus logical specifications
- Boudol, Larsen
- 1992
(Show Context)
Citation Context ...to model checking, and we can translate automata to logic. (An investigation of the model checking problems that can be reduced to implementation verification may, for instance, be found in the paper =-=[4]-=-.) Characteristic formulae provide a very elegant connection between automata and logic, and between implementation verification and model checking. But, can they be constructed for natural, and suita... |

21 | and forth bisimulations - Nicola, Montanari, et al. - 1990 |

21 | A modal characterisation of observable machine behaviour - Milner |

18 | A modal characterization of observational congruence on finite terms of CCS - Graf, Sifakis - 1986 |

16 | Reactive Systems: Modelling, Specification and Verification - Aceto, Ingolfsdottir, et al. - 2007 |

14 | Derivation of characteristic formulae - Müller-Olm |

13 | M.: A note on graded modal logic - Rijke - 2000 |

12 | Bisimulation throughprobabilistic testing. Information and Computation - Larsen, Skou - 1991 |

11 | Characteristic formulae for timed automata - Aceto, Ingólfsdóttir, et al. - 2009 |

10 | Non-strongly stable orders also define interesting simulation relations - Fábregas, Frutos-Escrig, et al. |

6 | Modal correspondence for models - Barwise, Moss - 1998 |

6 | Fra Hennessy-Milner logik til CCS-processer - Ingolfsdottir, Godskesen, et al. - 1987 |

6 | Finite models constructed from canonical formulas - Moss |

4 | Computing distinguishing formulas for branching bisimulation - Korver - 1991 |

4 | Functional Programming and Erratic Non-Determinism - Pitcher - 2001 |

4 | Modal logics for communicating systems. Theoret - Stirling - 1987 |

4 | An extended bisimulation induced by a preorder on actions - Thomsen - 1987 |

3 | Mathematical logic. Undergraduate Texts in Mathematics - Ebbinghaus, Flum, et al. - 1984 |

3 | Characteristic µ-calculus formula for an underspecified transition system - Fecher, Steffen - 2005 |

3 | A general approach to comparing infinite-state systems with their finite-state specifications - Schnoebelen |

2 | Vicious Circles, volume 60 of CSLI Lecture Notes - Barwise, Moss - 1996 |

2 | Orna Gruemberg, and Doron Peled. Model Checking - Clarke - 1999 |

2 | S.: Operational and epistemic approaches to protocol anlaysis: Bridging the gap - Dechesne, Mousavi, et al. - 2007 |

2 | Distinguishing formulas for free - Margaria, Steffen - 1993 |

1 | Boolean precongruences. journal submission - Levy - 2009 |

1 |
Jiˇrí Srba (2007): Reactive Systems: Modelling, Specification and Verification
- Aceto, Ingolfsdottir, et al.
(Show Context)
Citation Context ...ar fragment of CCS—up to bisimilarity using HML? The answer is negative because each formula in that logic can only describe a finite fragment of the initial behaviour of a process—see, for instance, =-=[1]-=- for a textbook presentation. However, as shown in, e.g., [18, 34], adding a facility for the recursive definition of formulae to (variants of) HML yields a logic that is powerful enough to support th... |

1 |
Lykke Pedersen & Jan Poulsen (2000): Characteristic formulae for timed automata
- Aceto, Ingolfsdottir, et al.
(Show Context)
Citation Context ...behavioural relations over finite labelled transition systems, Kripke structures and timed automata that are defined in terms of fixed points of suitable functions. (See, for instance, the references =-=[2, 5, 8, 13, 21, 23, 28]-=-.) Such constructions and their proofs of correctness have been developed independently, but have a common underlying structure. It is therefore natural to ask oneself whether one can provide a genera... |

1 |
Orna Gruemberg & Doron Peled
- Clarke
- 1999
(Show Context)
Citation Context ...ive Works License.2 Characteristic Formulae for Fixed-Point Semantics: A General Framework An alternative approach to the specification and verification of reactive systems is that of model checking =-=[7, 6, 32]-=-. In this approach, automata are still the formalism of choice for the description of the actual behaviour of a concurrent system. However, specifications of the expected behaviour of a system are now... |