Minimisation of models satisfying CTL formulas

Abstract : We study the problem of minimisation of a given finite pointed Kripke model satisfying a given CTL formula, with the only objective to preserve the satisfaction of that formula in the resulting reduced model. We consider minimisations of the model with respect both to state-based redundancies and formula-based redundancies in that model. We develop a procedure computing all such minimisations, illustrate it with some examples, and provide some complexity analysis for it.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02333575
Contributor : Frédéric Davesne <>
Submitted on : Friday, October 25, 2019 - 2:10:41 PM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM

Identifiers

Citation

Serenella Cerrito, Amélie David, Valentin Goranko. Minimisation of models satisfying CTL formulas. 26th International Symposium on Temporal Representation and Reasoning (TIME 2019), Oct 2019, Malage, Spain. pp.131--135, ⟨10.4230/LIPIcs.TIME.2019.13⟩. ⟨hal-02333575⟩

Share

Metrics

Record views

21