Reasoning about bounds in weighted transition systems

DOI10.23638/LMCS-14(4:19)2018MaRDI QIDQ4558788zbMATH OpenFDO

Authors Mikkel Hansen, Radu Mardare, Kim G. Larsen, Mathias Ruggaard Pedersen

Publication date 30 November 2018

Full work available at URL https://arxiv.org/abs/1703.03346

zbMATH Keywords

completenessmodal logicaxiomatizationbisimulationfinite model propertyweighted transition systemsatisfiabiblity

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• A complete approximation theory for weighted transition systems
• Complete proof systems for weighted modal logic
• Modal transition systems with weight intervals
• Quantitative analysis of weighted transition systems
• A decidable recursive logic for weighted transition systems

Cites work

• A complete approximation theory for weighted transition systems
• A complete deductive system for probability logic
• A decidable recursive logic for weighted transition systems
• Adequacy and complete axiomatization for timed modal logic
• Alternation-free weighted mu-calculus: decidability and completeness
• Automata, Languages and Programming
• Axiomatizing weighted synchronization trees and weighted bisimilarity
• Bisimulation through probabilistic testing
• Complete proof systems for weighted modal logic
• Concurrent weighted logic
• Continuous Markovian logic -- from complete axiomatization to the metric space of formulas
• Continuous Markovian logics -- axiomatization and quantified metatheory
• Decidability and expressiveness of recursive weighted logic
• Introduction to Boolean Algebras
• Modal transition systems with weight intervals
• Model-checking in dense real-time
• Modular Markovian Logic
• On decidability of recursive weighted logics
• On the satisfiability of some simple probabilistic logics
• Probability logic for type spaces
• Reasoning about knowledge and probability
• Stone duality for Markov processes
• Strong completeness for Markovian logics
• Weighted Automata and Weighted Logics on Infinite Words
• Weighted Logics for Traces
• Weighted picture automata and weighted logics
• Weighted register automata and weighted logic on data words
• Weighted tree automata and weighted logics
• Weighted versus Probabilistic Logics

Cited in

(5)

• Modal transition systems with weight intervals
• Weighted modal logic in epistemic and deontic contexts
• A complete axiomatization of weighted branching bisimulation
• Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems
• Bound problems in predicate networks and networks of weakly initial automata

This page was built for publication: Reasoning about bounds in weighted transition systems

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