Quantales and temporal logics
- We provide an algebraic semantics for the temporal logic CTL* and simplify it for its sublogics CTL and LTL. We abstractly represent state and path formulas over transition systems in Boolean left quantales. These are complete lattices with an operation of multiplication that is completely disjunctive in its left argument and isotone in its right argument. On these quantales, the semantics of CTL* formulas can be encoded via finite and infinite iteration operators, the CTL and LTL operators can be related to domain operators. This yields interesting new connections between representations as known from the modal μ-calculus and Kleene/ω-algebraic ones.
Download full text files
Postprint
Statistics
Additional Services
| Author: | Bernhard MöllerGND, Peter HöfnerGND, Georg StruthGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-359342 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/35934 |
| ISSN: | 0302-9743OPAC |
| Parent Title (English): | Lecture Notes in Computer Science |
| Publisher: | Springer |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 2006 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2017/07/21 |
| Volume: | 4019 |
| First Page: | 263 |
| Last Page: | 277 |
| DOI: | https://doi.org/10.1007/11784180_21 |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
| Licence (German): |  Deutsches Urheberrecht |
