On decidability of recursive weighted logics

DOI10.1007/S00500-016-2193-ZMaRDI QIDQ1797779zbMATH OpenOpenAlexFDO

Authors Radu Mardare, Bingtian Xue, Kim G. Larsen

Publication date 22 October 2018

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-016-2193-z

zbMATH Keywords

satisfiabilitymulti-modal logicmodel constructionweighted constraintslabelled weighted transition systemmaximal fixed point computation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) 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

• A decidable recursive logic for weighted transition systems
• Decidability and expressiveness of recursive weighted logic
• Logics for weighted timed pushdown automata
• Concurrent weighted logic
• Alternation-free weighted mu-calculus: decidability and completeness

Cites work

• scientific article; zbMATH DE number 177824 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• scientific article; zbMATH DE number 1794360 (Why is no real title available?)
• scientific article; zbMATH DE number 1794367 (Why is no real title available?)
• scientific article; zbMATH DE number 755666 (Why is no real title available?)
• A decidable recursive logic for weighted transition systems
• A lattice-theoretical fixpoint theorem and its applications
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• Adequacy and complete axiomatization for timed modal logic
• Complete proof systems for weighted modal logic
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Decidability and expressiveness of recursive weighted logic
• From timed automata to logic -- and back
• Handbook of weighted automata
• Model-checking in dense real-time
• Proof systems for satisfiability in Hennessy-Milner logic with recursion
• Reactive Systems
• Symbolic model checking for real-time systems

Cited in

(7)

• On Partial Covers, Reducts and Decision Rules with Weights
• Characterizations of Weighted First-Order Logics over Semirings
• scientific article; zbMATH DE number 6987096 (Why is no real title available?)
• A computationally grounded, weighted doxastic logic
• Concurrent weighted logic
• A decidable recursive logic for weighted transition systems
• Decidability and expressiveness of recursive weighted logic

This page was built for publication: On decidability of recursive weighted logics

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