Decidability and expressiveness of recursive weighted logic

DOI10.1007/978-3-662-46823-4_18zbMATH Open1434.68330OpenAlexW2244361945MaRDI QIDQ3455072FDOQ3455072

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

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

zbMATH Keywords

satisfiabilityHennessy-Milner propertymaximal fixed pointlabelled weighted transition system

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)

Cited In (9)

• Alternation-free weighted mu-calculus: decidability and completeness
• On Partial Covers, Reducts and Decision Rules with Weights
• Quantitative Verification of Weighted Kripke Structures
• A Weighted-Logic Representation of C-Revising Ordinal Conditional Functions
• Characterizations of Weighted First-Order Logics over Semirings
• Title not available (Why is that?)
• A computationally grounded, weighted doxastic logic
• A decidable recursive logic for weighted transition systems
• On decidability of recursive weighted logics

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)