On decidability of recursive weighted logics
DOI10.1007/S00500-016-2193-ZOpenAlexW2465857341MaRDI QIDQ1797779
Radu Mardare, Bingtian Xue, Kim Guldstrand 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
satisfiabilitymulti-modal logicmodel constructionweighted constraintslabelled weighted transition systemmaximal fixed point computation
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adequacy and complete axiomatization for timed modal logic
- Model-checking in dense real-time
- Handbook of weighted automata
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Symbolic model checking for real-time systems
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Complete proof systems for weighted modal logic
- A lattice-theoretical fixpoint theorem and its applications
- A Decidable Recursive Logic for Weighted Transition Systems
- Decidability and Expressiveness of Recursive Weighted Logic
- From timed automata to logic — and back
- Reactive Systems
This page was built for publication: On decidability of recursive weighted logics
