Reasoning about bounds in weighted transition systems
From MaRDI portal
Publication:4558788
DOI10.23638/LMCS-14(4:19)2018MaRDI QIDQ4558788FDOQ4558788
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
Recommendations
completenessmodal logicaxiomatizationbisimulationfinite model propertyweighted transition systemsatisfiabiblity
Cites Work
- Axiomatizing weighted synchronization trees and weighted bisimilarity
- Model-checking in dense real-time
- Bisimulation through probabilistic testing
- Introduction to Boolean Algebras
- Adequacy and complete axiomatization for timed modal logic
- Continuous Markovian logic -- from complete axiomatization to the metric space of formulas
- Reasoning about knowledge and probability
- Continuous Markovian logics -- axiomatization and quantified metatheory
- Stone duality for Markov processes
- Probability logic for type spaces
- On decidability of recursive weighted logics
- Complete proof systems for weighted modal logic
- Decidability and expressiveness of recursive weighted logic
- Weighted versus Probabilistic Logics
- Modal transition systems with weight intervals
- Automata, Languages and Programming
- A complete approximation theory for weighted transition systems
- A complete deductive system for probability logic
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted tree automata and weighted logics
- Weighted Logics for Traces
- Weighted picture automata and weighted logics
- Strong completeness for Markovian logics
- Modular Markovian Logic
- Concurrent weighted logic
- On the satisfiability of some simple probabilistic logics
- Weighted register automata and weighted logic on data words
- A decidable recursive logic for weighted transition systems
- Alternation-free weighted mu-calculus: decidability and completeness
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)
