Weighted versus Probabilistic Logics
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- A Weighted μ-Calculus on Words
- A logic for reasoning about time and reliability
- A theory of timed automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- Formal Modeling and Analysis of Timed Systems
- Handbook of weighted automata
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Model checking games for the quantitative \(\mu\)-calculus
- On Decision Problems for Probabilistic Büchi Automata
- On Reduction Criteria for Probabilistic Reward Models
- Probabilistic automata
- Probability and Nondeterminism in Operational Models of Concurrency
- Reactive, generative, and stratified models of probabilistic processes
- Results on the propositional \(\mu\)-calculus
- The complexity of probabilistic verification
- Validation of Stochastic Systems
- Validation of Stochastic Systems
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted Automata and Weighted Logics with Discounting
- Weighted automata and weighted logics
- Weighted tree automata and weighted logics
Cited in
(29)- Weighted operator precedence languages
- Pebble weighted automata and weighted logics
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Weighted automata and logics on infinite graphs
- Probabilistic comparison of weighted majority rules
- scientific article; zbMATH DE number 7561720 (Why is no real title available?)
- A Weighted-Logic Representation of C-Revising Ordinal Conditional Functions
- scientific article; zbMATH DE number 6987096 (Why is no real title available?)
- A computationally grounded, weighted doxastic logic
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Model checking computation tree logic over finite lattices
- Weighted register automata and weighted logic on data words
- Weighted register automata and weighted logic on data words
- Weighted positive binary decision diagrams for exact probabilistic inference
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
- Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
- Logics for weighted timed pushdown automata
- A quantitative characterization of weighted Kripke structures in temporal logic
- Weighted operator precedence languages
- A quantitative characterization of weighted Kripke structures in temporal logic
- Weighted automata
- Weight assignment logic
- A Nivat theorem for weighted picture automata and weighted MSO logic
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Models for quantitative distributed systems and multi-valued logics
- Advances in weighted logics for artificial intelligence
- Adding pebbles to weighted automata: easy specification \& efficient evaluation
- A Nivat theorem for weighted picture automata and weighted MSO logics
- A logic-based approach to incremental reasoning on multi-agent systems
This page was built for publication: Weighted versus Probabilistic Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637211)
