Decidability and expressiveness of recursive weighted logic

Kim Guldstrand Larsen, Radu Mardare, Bingtian Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

2 Citations (Scopus)

Abstract

Labelled weighted transition systems (LWSs) are transition systems labelled with actions and real numbers. The numbers represent the costs of the corresponding actions in terms of resources. Recursive Weighted Logic (RWL) is a multimodal logic that expresses qualitative and quantitative properties of LWSs. It is endowed with simultaneous recursive equations, which specify the weakest properties satisfied by the recursive variables. We demonstrate that RWL is sufficiently expressive to characterize weighted-bisimilarity of LWSs. In addition, we prove that the logic is decidable, i.e., the satisfiability problem for RWL can be algorithmically solved.

Original languageEnglish
Title of host publicationPerspectives of System Informatics - 9th International Ershov Informatics Conference, PSI 2014, Revised Selected Papers
EditorsIrina Virbitskaite, Andrei Voronkov, Irina Virbitskaite
PublisherSpringer-Verlag
Pages216-231
Number of pages16
ISBN (Print)9783662468227
DOIs
Publication statusPublished - 1 Jan 2015
Event9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014 - St. Petersburg, Russian Federation
Duration: 24 Jun 201427 Jun 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8974
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014
CountryRussian Federation
CitySt. Petersburg
Period24/06/1427/06/14

Fingerprint

Computability and decidability
Expressiveness
Decidability
Logic
Transition Systems
Costs
Multi-modal Logic
Labeled Transition System
Satisfiability Problem
Express
Resources
Demonstrate

Keywords

  • Hennessy-Milner property
  • labelled weighted transition system
  • maximal fixed point
  • satisfiability

Cite this

Larsen, K. G., Mardare, R., & Xue, B. (2015). Decidability and expressiveness of recursive weighted logic. In I. Virbitskaite, A. Voronkov, & I. Virbitskaite (Eds.), Perspectives of System Informatics - 9th International Ershov Informatics Conference, PSI 2014, Revised Selected Papers (pp. 216-231). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8974). Springer-Verlag. https://doi.org/10.1007/978-3-662-46823-4_18
Larsen, Kim Guldstrand ; Mardare, Radu ; Xue, Bingtian. / Decidability and expressiveness of recursive weighted logic. Perspectives of System Informatics - 9th International Ershov Informatics Conference, PSI 2014, Revised Selected Papers. editor / Irina Virbitskaite ; Andrei Voronkov ; Irina Virbitskaite. Springer-Verlag, 2015. pp. 216-231 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{dfa124e9e5f6462abc922d8d40c909e7,
title = "Decidability and expressiveness of recursive weighted logic",
abstract = "Labelled weighted transition systems (LWSs) are transition systems labelled with actions and real numbers. The numbers represent the costs of the corresponding actions in terms of resources. Recursive Weighted Logic (RWL) is a multimodal logic that expresses qualitative and quantitative properties of LWSs. It is endowed with simultaneous recursive equations, which specify the weakest properties satisfied by the recursive variables. We demonstrate that RWL is sufficiently expressive to characterize weighted-bisimilarity of LWSs. In addition, we prove that the logic is decidable, i.e., the satisfiability problem for RWL can be algorithmically solved.",
keywords = "Hennessy-Milner property, labelled weighted transition system, maximal fixed point, satisfiability",
author = "Larsen, {Kim Guldstrand} and Radu Mardare and Bingtian Xue",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-662-46823-4_18",
language = "English",
isbn = "9783662468227",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "216--231",
editor = "Irina Virbitskaite and Andrei Voronkov and Irina Virbitskaite",
booktitle = "Perspectives of System Informatics - 9th International Ershov Informatics Conference, PSI 2014, Revised Selected Papers",

}

Larsen, KG, Mardare, R & Xue, B 2015, Decidability and expressiveness of recursive weighted logic. in I Virbitskaite, A Voronkov & I Virbitskaite (eds), Perspectives of System Informatics - 9th International Ershov Informatics Conference, PSI 2014, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8974, Springer-Verlag, pp. 216-231, 9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014, St. Petersburg, Russian Federation, 24/06/14. https://doi.org/10.1007/978-3-662-46823-4_18

Decidability and expressiveness of recursive weighted logic. / Larsen, Kim Guldstrand; Mardare, Radu; Xue, Bingtian.

Perspectives of System Informatics - 9th International Ershov Informatics Conference, PSI 2014, Revised Selected Papers. ed. / Irina Virbitskaite; Andrei Voronkov; Irina Virbitskaite. Springer-Verlag, 2015. p. 216-231 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8974).

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

TY - GEN

T1 - Decidability and expressiveness of recursive weighted logic

AU - Larsen, Kim Guldstrand

AU - Mardare, Radu

AU - Xue, Bingtian

PY - 2015/1/1

Y1 - 2015/1/1

N2 - Labelled weighted transition systems (LWSs) are transition systems labelled with actions and real numbers. The numbers represent the costs of the corresponding actions in terms of resources. Recursive Weighted Logic (RWL) is a multimodal logic that expresses qualitative and quantitative properties of LWSs. It is endowed with simultaneous recursive equations, which specify the weakest properties satisfied by the recursive variables. We demonstrate that RWL is sufficiently expressive to characterize weighted-bisimilarity of LWSs. In addition, we prove that the logic is decidable, i.e., the satisfiability problem for RWL can be algorithmically solved.

AB - Labelled weighted transition systems (LWSs) are transition systems labelled with actions and real numbers. The numbers represent the costs of the corresponding actions in terms of resources. Recursive Weighted Logic (RWL) is a multimodal logic that expresses qualitative and quantitative properties of LWSs. It is endowed with simultaneous recursive equations, which specify the weakest properties satisfied by the recursive variables. We demonstrate that RWL is sufficiently expressive to characterize weighted-bisimilarity of LWSs. In addition, we prove that the logic is decidable, i.e., the satisfiability problem for RWL can be algorithmically solved.

KW - Hennessy-Milner property

KW - labelled weighted transition system

KW - maximal fixed point

KW - satisfiability

UR - http://www.scopus.com/inward/record.url?scp=84942532191&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-46823-4_18

DO - 10.1007/978-3-662-46823-4_18

M3 - Conference contribution book

AN - SCOPUS:84942532191

SN - 9783662468227

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 216

EP - 231

BT - Perspectives of System Informatics - 9th International Ershov Informatics Conference, PSI 2014, Revised Selected Papers

A2 - Virbitskaite, Irina

A2 - Voronkov, Andrei

A2 - Virbitskaite, Irina

PB - Springer-Verlag

ER -

Larsen KG, Mardare R, Xue B. Decidability and expressiveness of recursive weighted logic. In Virbitskaite I, Voronkov A, Virbitskaite I, editors, Perspectives of System Informatics - 9th International Ershov Informatics Conference, PSI 2014, Revised Selected Papers. Springer-Verlag. 2015. p. 216-231. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-46823-4_18