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)


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
Number of pages16
ISBN (Print)9783662468227
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)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014
Country/TerritoryRussian Federation
CitySt. Petersburg


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


Dive into the research topics of 'Decidability and expressiveness of recursive weighted logic'. Together they form a unique fingerprint.

Cite this