Abstract
We extend the usual notion of Kripke Structures with a weighted transition relation, and generalize the usual Boolean satisfaction relation of CTL to a map which assigns to states and temporal formulae a real-valued distance describing the degree of satisfaction. We describe a general approach to obtaining quantitative interpretations for a generic extension of the CTL syntax, and show that, for one such interpretation, the logic is both adequate and expressive with respect to quantitative bisimulation.
| Originalsprog | Engelsk |
|---|---|
| Titel | Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science |
| Forlag | Schloss Dagstuhl. Leibniz-Zentrum für Informatik |
| Publikationsdato | 2009 |
| ISBN (Trykt) | 978-3-939897-15-6 |
| Status | Udgivet - 2009 |
| Begivenhed | Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) - Znojmo, Tjekkiet Varighed: 13 nov. 2009 → 15 nov. 2009 |
Konference
| Konference | Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) |
|---|---|
| Land/Område | Tjekkiet |
| By | Znojmo |
| Periode | 13/11/2009 → 15/11/2009 |
Emneord
- quantitative analysis
- Krikpe structures
- characteristic formula
- bisimulation distance
- weighted CTL