Embedding CTL* in an Extension to Interval Temporal Logic (ITL)
- In this paper we present an embedding of the most common branching time logics (CTL/CTL*) in an extension of interval temporal logic (ITL+). The significance of this result is threefold: first the theoretical aspect is, that branching time and linear time are not so much different. A more practical aspect is that the intuitive interactive proof method of symbolic execution of ITL+ can be used for branching time logics as well. The opposite direction is interesting as well, for a subset of finite state systems, interactive verification of ITL+ formulas can be translated into a model checking problem. The proof presented in this paper has been done with the interactive theorem prover KIV. So this contribution can also be seen as a case study on reasoning about temporal logics in an interactive verification environment.
| Author: | Frank OrtmeierORCiDGND, Michael BalserGND, Andriy DunetsGND, Simon BäumlerGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-10218 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/1187 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2008-16) |
| Type: | Report |
| Language: | English |
| Date of Publication (online): | 2008/10/29 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2008/10/29 |
| Tag: | CTL; ITL+; interactive verification; model checking; temporal logics |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
| Licence (German): |  Deutsches Urheberrecht |
