Multi-weighted automata and MSO logic

DOI10.1007/s00224-015-9658-9zbMath1356.68130arXiv1506.06024OpenAlexW1947371057MaRDI QIDQ504993

Manfred Droste, Vitaly Perevoshchikov

Publication date: 18 January 2017

Published in: Theory of Computing Systems, Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.06024

zbMATH Keywords

power seriesquantitative logicaverage behaviormulti-priced automataquantitative languagesreward-cost ratio

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (8)

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Weight Assignment Logic ⋮ Weighted Linear Dynamic Logic ⋮ Quantitative vs. weighted automata ⋮ Multi-weighted automata and MSO logic ⋮ Unnamed Item ⋮ A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties ⋮ On deterministic weighted automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-weighted automata and MSO logic
• MSO logics for weighted timed automata
• Metrics for weighted transition systems: axiomatization and complexity
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Handbook of weighted automata
• Weighted automata and weighted MSO logics for average and long-time behaviors
• Synthesizing robust systems
• Weighted automata and weighted logics
• Optimal infinite scheduling for multi-priced timed automata
• Expressiveness and Closure Properties for Quantitative Languages
• Algorithms for the Multi-constrained Routing Problem
• Energy Games in Multiweighted Automata
• Weak Second‐Order Arithmetic and Finite Automata
• Quantitative Languages
• Weighted versus Probabilistic Logics
• Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
• Pebble Weighted Automata and Weighted Logics
• Discount-Optimal Infinite Runs in Priced Timed Automata
• Hybrid Systems: Computation and Control
• Combinatorial optimization with rational objective functions
• Foundations of Software Science and Computational Structures
• Automata, Languages and Programming
• Quantitative Languages Defined by Functional Automata

This page was built for publication: Multi-weighted automata and MSO logic