Quantitative vs. weighted automata
From MaRDI portal
Publication:2695484
DOI10.1007/978-3-030-89716-1_1OpenAlexW3210996054MaRDI QIDQ2695484
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89716-1_1
Related Items (2)
Integer Weighted Automata on Infinite Words ⋮ Token Games and History-Deterministic Quantitative-Automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rigorous approximated determinization of weighted automata
- Multi-weighted automata and MSO logic
- Reactive synthesis without regret
- First-order logic and star-free sets
- Alternating weighted automata over commutative semirings
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Quantitative assume guarantee synthesis
- Universal graphs and good for games automata: new tools for infinite duration games
- Weighted automata and weighted logics
- Non-Zero Sum Games for Reactive Synthesis
- Weighted LTL with Discounting
- Quantitative languages
- Temporal Specifications with Accumulative Values
- Approximate Determinization of Quantitative Automata
- QUASY: Quantitative Synthesis Tool
- Max and Sum Semantics for Alternating Weighted Automata
- What’s Decidable about Weighted Automata?
- Automata Theory and Model Checking
- Formally Reasoning About Quality
- Alternating Weighted Automata
- Averaging in LTL
- Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
- On the definition of a family of automata
- Alternating Pushdown and Stack Automata
- Quantitative Languages
- Describing Average- and Longtime-Behavior by Weighted MSO Logics
- Solving Games Without Determinization
- Weighted Automata and Weighted Logics on Infinite Words
- Better Quality in Synthesis through Quantitative Objectives
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Decision Problems of Finite Automata Design and Related Arithmetics
- Alternation
- A combinatorial approach to the theory of ω-automata
- Application of model theoretic games to discrete linear orders and finite automata
- Star-free regular sets of ω-sequences
- Finite Automata Computing Real Functions
- Nested Weighted Automata
- Why These Automata Types?
- On finite monoids having only trivial subgroups
- Exact and Approximate Determinization of Discounted-Sum Automata
- Model Checking Quantitative Linear Time Logic
- Discounting in LTL
- Probabilistic automata
- Quantitative Languages Defined by Functional Automata
- An approximate determinization algorithm for weighted finite-state automata
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
This page was built for publication: Quantitative vs. weighted automata
