Decidability and Expressiveness of Recursive Weighted Logic

DOI10.1007/978-3-662-46823-4_18zbMath1434.68330OpenAlexW2244361945MaRDI QIDQ3455072

Bingtian Xue, Radu Mardare, Kim Guldstrand Larsen

Publication date: 3 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46823-4_18

zbMATH Keywords

satisfiabilityHennessy-Milner propertymaximal fixed pointlabelled weighted transition system

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (3)

Alternation-free weighted mu-calculus: decidability and completeness ⋮ Unnamed Item ⋮ On decidability of recursive weighted logics

This page was built for publication: Decidability and Expressiveness of Recursive Weighted Logic