Decidability and expressiveness of recursive weighted logic

DOI10.1007/978-3-662-46823-4_18MaRDI QIDQ3455072zbMATH OpenOpenAlexFDO

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

Hennessy-Milner propertylabelled weighted transition systemmaximal fixed pointsatisfiability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) 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
• A decidable recursive logic for weighted transition systems
• Weighted linear dynamic logic
• Logics for weighted timed pushdown automata
• A complete approximation theory for weighted transition systems

Cited in

(9)

• On decidability of recursive weighted logics
• Characterizations of Weighted First-Order Logics over Semirings
• A decidable recursive logic for weighted transition systems
• A computationally grounded, weighted doxastic logic
• Quantitative Verification of Weighted Kripke Structures
• On Partial Covers, Reducts and Decision Rules with Weights
• Reasoning about bounds in weighted transition systems
• A Weighted-Logic Representation of C-Revising Ordinal Conditional Functions
• Alternation-free weighted mu-calculus: decidability and completeness

This page was built for publication: Decidability and expressiveness of recursive weighted logic

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