A Decidable Recursive Logic for Weighted Transition Systems

DOI10.1007/978-3-319-10882-7_27zbMath1432.68310OpenAlexW1606607881MaRDI QIDQ2938181

Bingtian Xue, Radu Mardare, Kim Guldstrand Larsen

Publication date: 13 January 2015

Published in: Theoretical Aspects of Computing – ICTAC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10882-7_27

zbMATH Keywords

multi-modal logiclabelled weighted transition systemmaximal fixed-point computation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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: A Decidable Recursive Logic for Weighted Transition Systems