A decidable recursive logic for weighted transition systems

DOI10.1007/978-3-319-10882-7_27MaRDI QIDQ2938181zbMATH OpenOpenAlexFDO

Authors Radu Mardare, Bingtian Xue, Kim G. 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

labelled weighted transition systemmaximal fixed-point computationmulti-modal logic

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)

Recommendations

• On decidability of recursive weighted logics
• Decidability and expressiveness of recursive weighted logic
• Concurrent weighted logic
• Logics for weighted timed pushdown automata
• Complete proof systems for weighted modal logic

Cited in

(6)

• On decidability of recursive weighted logics
• Decidability and expressiveness of recursive weighted logic
• Reasoning about bounds in weighted transition systems
• Weighted Pushdown Systems with Indexed Weight Domains
• Alternation-free weighted mu-calculus: decidability and completeness
• Concurrent weighted logic

This page was built for publication: A decidable recursive logic for weighted transition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938181)