Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TIME.2019.13
URN: urn:nbn:de:0030-drops-113718
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11371/
Cerrito, Serenella ; David, Amélie ; Goranko, Valentin
Minimisation of Models Satisfying CTL Formulas
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{cerrito_et_al:LIPIcs:2019:11371,
author = {Serenella Cerrito and Am{\'e}lie David and Valentin Goranko},
title = {{Minimisation of Models Satisfying CTL Formulas}},
booktitle = {26th International Symposium on Temporal Representation and Reasoning (TIME 2019)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-127-6},
ISSN = {1868-8969},
year = {2019},
volume = {147},
editor = {Johann Gamper and Sophie Pinchinat and Guido Sciavicco},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11371},
URN = {urn:nbn:de:0030-drops-113718},
doi = {10.4230/LIPIcs.TIME.2019.13},
annote = {Keywords: CTL, model minimisation, bisimulation reduction, tableaux-based reduction}
}
| Keywords: | CTL, model minimisation, bisimulation reduction, tableaux-based reduction | |
| Seminar: | 26th International Symposium on Temporal Representation and Reasoning (TIME 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 07.10.2019 |
