scientific article; zbMATH DE number 6987096
From MaRDI portal
Publication:4558788
DOI10.23638/LMCS-14(4:19)2018MaRDI QIDQ4558788
Radu Mardare, Mikkel Hansen, Kim Guldstrand Larsen, Mathias Ruggaard Pedersen
Publication date: 30 November 2018
Full work available at URL: https://arxiv.org/abs/1703.03346
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
modal logiccompletenessbisimulationfinite model propertyaxiomatizationweighted transition systemsatisfiabiblity
Related Items (2)
Weighted modal logic in epistemic and deontic contexts ⋮ A complete axiomatization of weighted branching bisimulation
Cites Work
- Unnamed Item
- Adequacy and complete axiomatization for timed modal logic
- Modal transition systems with weight intervals
- Model-checking in dense real-time
- Weighted tree automata and weighted logics
- Concurrent weighted logic
- Bisimulation through probabilistic testing
- A complete approximation theory for weighted transition systems
- On decidability of recursive weighted logics
- Complete proof systems for weighted modal logic
- Weighted picture automata and weighted logics
- Axiomatizing weighted synchronization trees and weighted bisimilarity
- Strong Completeness for Markovian Logics
- A Decidable Recursive Logic for Weighted Transition Systems
- Modular Markovian Logic
- Weighted Register Automata and Weighted Logic on Data Words
- Weighted Logics for Traces
- Decidability and Expressiveness of Recursive Weighted Logic
- Introduction to Boolean Algebras
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted versus Probabilistic Logics
- A Complete Deductive System for Probability Logic
- Reasoning about knowledge and probability
- On the Satisfiability of Some Simple Probabilistic Logics
- Continuous Markovian Logics - Axiomatization and Quantified Metatheory
- Stone Duality for Markov Processes
- Automata, Languages and Programming
- Probability logic for type spaces
- Alternation-free weighted mu-calculus: decidability and completeness
This page was built for publication: