Weighted versus Probabilistic Logics

DOI10.1007/978-3-642-02737-6_2zbMath1247.03067OpenAlexW1491991866MaRDI QIDQ3637211

Paul Gastin, Benedikt Bollig

Publication date: 7 July 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_2

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)

Related Items (23)

Weighted Register Automata and Weighted Logic on Data Words ⋮ Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ Logics for Weighted Timed Pushdown Automata ⋮ Weighted automata and weighted MSO logics for average and long-time behaviors ⋮ Model checking computation tree logic over finite lattices ⋮ A Nivat theorem for weighted picture automata and weighted MSO logics ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Multi-weighted automata and MSO logic ⋮ Weighted automata and logics for infinite nested words ⋮ Pebble Weighted Automata and Weighted Logics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Weighted register automata and weighted logic on data words ⋮ A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic ⋮ A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties ⋮ Weighted Automata and Logics on Infinite Graphs ⋮ Weighted operator precedence languages ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ Weighted automata ⋮ Weighted Operator Precedence Languages ⋮ A logic-based approach to incremental reasoning on multi-agent systems ⋮ Models for quantitative distributed systems and multi-valued logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Handbook of weighted automata
• Weighted tree automata and weighted logics
• A theory of timed automata
• A logic for reasoning about time and reliability
• Reactive, generative, and stratified models of probabilistic processes
• Weighted automata and weighted logics
• Weak Second‐Order Arithmetic and Finite Automata
• Weighted Automata and Weighted Logics with Discounting
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• A Weighted μ-Calculus on Words
• Decision Problems of Finite Automata Design and Related Arithmetics
• The complexity of probabilistic verification
• Validation of Stochastic Systems
• Validation of Stochastic Systems
• On Reduction Criteria for Probabilistic Reward Models
• On Decision Problems for Probabilistic Büchi Automata
• Probabilistic automata
• Formal Modeling and Analysis of Timed Systems
• Probability and Nondeterminism in Operational Models of Concurrency

This page was built for publication: Weighted versus Probabilistic Logics