Alternation-free weighted mu-calculus: decidability and completeness

DOI10.1016/j.entcs.2015.12.018zbMath1351.68164WikidataQ113317723 ScholiaQ113317723MaRDI QIDQ5971405

Radu Mardare, Bingtian Xue, Kim Guldstrand Larsen

Publication date: 16 December 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2015.12.018

zbMATH Keywords

satisfiability; complete axiomatization; non-compact modal logics; weighted transition systems; weighted modal mu-calculus

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)