Weighted automata and weighted MSO logics for average and long-time behaviors

DOI10.1016/j.ic.2012.10.001zbMath1279.68148OpenAlexW1981797649MaRDI QIDQ1932173

Ingmar Meinecke, Manfred Droste

Publication date: 17 January 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2012.10.001

zbMATH Keywords

weighted automataweighted logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (26)

Crisp-determinization of weighted tree automata over strong bimonoids ⋮ Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Weight Assignment Logic ⋮ Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ A Nivat theorem for weighted picture automata and weighted MSO logics ⋮ Weighted Linear Dynamic Logic ⋮ Quantitative vs. weighted automata ⋮ Automata with Auxiliary Weights ⋮ Unnamed Item ⋮ On weighted first-order logics with discounting ⋮ Multi-weighted automata and MSO logic ⋮ Weighted automata and logics for infinite nested words ⋮ Unnamed Item ⋮ Model checking of linear-time properties in multi-valued systems ⋮ 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 ⋮ On deterministic weighted automata ⋮ Weighted Automata and Logics on Infinite Graphs ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ Weighted propositional configuration logics: a specification language for architectures with quantitative features ⋮ What's decidable about weighted automata? ⋮ Weighted operator precedence languages ⋮ Weighted automata ⋮ Monitor Logics for Quantitative Monitor Automata ⋮ Weighted Operator Precedence Languages ⋮ Qualitative analysis of concurrent mean-payoff games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards more realistic (e.g., non-associative) ``and - and ``or-operations in fuzzy logic
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Handbook of weighted automata
• Weighted automata and weighted logics with discounting
• Weighted automata and weighted logics on infinite words
• Weighted finite automata over strong bimonoids
• Weighted tree automata and weighted logics
• Weighted automata and weighted logics
• Models for Quantitative Distributed Systems and Multi-Valued Logics
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
• Valuations of Weighted Automata: Doing It in a Rational Way
• Alternating Weighted Automata
• Probabilistic Weighted Automata
• WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS
• Weak Second‐Order Arithmetic and Finite Automata
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Quantitative Languages
• Describing Average- and Longtime-Behavior by Weighted MSO Logics
• Weighted versus Probabilistic Logics
• Weighted Timed MSO Logics
• Decision Problems of Finite Automata Design and Related Arithmetics
• Lattice Automata
• Logic Programming
• Automata, Languages and Programming

This page was built for publication: Weighted automata and weighted MSO logics for average and long-time behaviors