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.
@InProceedings{larsen_et_al:OASIcs:2009:DROPS.MEMICS.2009.2345, author = {Larsen, Kim G. and Fahrenberg, Uli and Thrane, Claus}, title = {{A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic}}, booktitle = {Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09)}, pages = {10--17}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-15-6}, ISSN = {2190-6807}, year = {2009}, volume = {13}, editor = {Hlinen\'{y}, Petr and Maty\'{a}\v{s}, V\'{a}clav and Vojnar, Tom\'{a}\v{s}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DROPS.MEMICS.2009.2345}, URN = {urn:nbn:de:0030-drops-23454}, doi = {10.4230/DROPS.MEMICS.2009.2345}, annote = {Keywords: Quantitative analysis, Kripke structures, characteristic formulae, bisimulation distance, weighted CTL} }
Feedback for Dagstuhl Publishing