Minimisation of models satisfying CTL formulas - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Minimisation of models satisfying CTL formulas


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.
No file

Dates and versions

hal-02333575 , version 1 (25-10-2019)



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⟩
33 View
0 Download



Gmail Facebook X LinkedIn More