Decidability and expressiveness of recursive weighted logic

Kim G. Larsen; Radu Mardare; Bingtian Xue

Decidability and expressiveness of recursive weighted logic

Kim G. Larsen, Radu Mardare, Bingtian Xue

Computer And Information Sciences

Research output: Contribution to conference › Paper › peer-review

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 language	English
Pages	216-231
Number of pages	16
Publication status	Published - 27 Jun 2014
Event	9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014 - St. Petersburg, Russian Federation Duration: 24 Jun 2014 → 27 Jun 2014

Conference

Conference	9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014
Country/Territory	Russian Federation
City	St. Petersburg
Period	24/06/14 → 27/06/14

Keywords

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

Cite this

@conference{095bd1dab841444ca8fa303f293b37d8,

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 = "labelled weighted transition system, maximal fixed point, Hennessy-Milner property, satisfiability",

author = "Larsen, {Kim G.} and Radu Mardare and Bingtian Xue",

year = "2014",

month = jun,

day = "27",

language = "English",

pages = "216--231",

note = "9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014 ; Conference date: 24-06-2014 Through 27-06-2014",

}

TY - CONF

T1 - Decidability and expressiveness of recursive weighted logic

AU - Larsen, Kim G.

AU - Mardare, Radu

AU - Xue, Bingtian

PY - 2014/6/27

Y1 - 2014/6/27

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 - labelled weighted transition system

KW - maximal fixed point

KW - Hennessy-Milner property

KW - satisfiability

M3 - Paper

SP - 216

EP - 231

T2 - 9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014

Y2 - 24 June 2014 through 27 June 2014

ER -

Decidability and expressiveness of recursive weighted logic

Abstract

Conference

Keywords

Fingerprint

Cite this