Quantitative Languages
From MaRDI portal
Publication:3540192
DOI10.1007/978-3-540-87531-4_28zbMath1156.68449OpenAlexW2912461213MaRDI QIDQ3540192
Laurent Doyen, Krishnendu Chatterjee, Thomas A. Henzinger
Publication date: 20 November 2008
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_28
Related Items (42)
Synthesizing Efficient Controllers ⋮ Model measuring for discrete and hybrid systems ⋮ Weight Assignment Logic ⋮ Modeling for Verification ⋮ Mean-payoff games with partial observation ⋮ Multi-Valued Reasoning about Reactive Systems ⋮ Probabilistic Weighted Automata ⋮ Latticed-LTL synthesis in the presence of noisy inputs ⋮ Rigorous approximated determinization of weighted automata ⋮ Weighted finite automata over hemirings ⋮ Temporal Specifications with Accumulative Values ⋮ Parameterized Weighted Containment ⋮ Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ Weighted automata and weighted MSO logics for average and long-time behaviors ⋮ Satisfiability of quantitative probabilistic CTL: rise to the challenge ⋮ A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings ⋮ Coping with selfish on-going behaviors ⋮ Optimal repair for omega-regular properties ⋮ Quantitative vs. weighted automata ⋮ A note on the approximation of mean-payoff games ⋮ Multi-weighted automata and MSO logic ⋮ Weighted automata and logics for infinite nested words ⋮ An abstraction-refinement framework for trigger querying ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Quantitative Simulation Games ⋮ Quantitative analysis of weighted transition systems ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ Weighted register automata and weighted logic on data words ⋮ A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic ⋮ On Omega-Languages Defined by Mean-Payoff Conditions ⋮ Regular Expressions on Average and in the Long Run ⋮ Weighted Automata and Logics on Infinite Graphs ⋮ What's decidable about weighted automata? ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ On the Supports of Recognizable Timed Series ⋮ Monitor Logics for Quantitative Monitor Automata ⋮ Models for quantitative distributed systems and multi-valued logics ⋮ Conway and iteration hemirings Part 1 ⋮ Conway and iteration hemirings Part 2
This page was built for publication: Quantitative Languages
