Quantitative Languages
From MaRDI portal
Publication:3540192
DOI10.1007/978-3-540-87531-4_28zbMath1156.68449MaRDI 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
68Q45: Formal languages and automata
Related Items
Multi-Valued Reasoning about Reactive Systems, Monitor Logics for Quantitative Monitor Automata, Satisfiability of quantitative probabilistic CTL: rise to the challenge, A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings, Optimal repair for omega-regular properties, Rigorous approximated determinization of weighted automata, Weighted finite automata over hemirings, Coping with selfish on-going behaviors, Multi-weighted automata and MSO logic, Weighted automata and logics for infinite nested words, An improved algorithm for determinization of weighted and fuzzy automata, Quantitative analysis of weighted transition systems, Weighted automata and multi-valued logics over arbitrary bounded lattices, Determinization of weighted finite automata over strong bimonoids, Latticed-LTL synthesis in the presence of noisy inputs, Weighted register automata and weighted logic on data words, Weighted automata and weighted MSO logics for average and long-time behaviors, What's decidable about weighted automata?, An abstraction-refinement framework for trigger querying, Model measuring for discrete and hybrid systems, A note on the approximation of mean-payoff games, Mean-payoff games with partial observation, Quantitative vs. weighted automata, A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic, Weighted Automata and Logics on Infinite Graphs, Models for quantitative distributed systems and multi-valued logics, Conway and iteration hemirings Part 1, Conway and iteration hemirings Part 2, Synthesizing Efficient Controllers, Temporal Specifications with Accumulative Values, Parameterized Weighted Containment, Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics, Regular Expressions on Average and in the Long Run, 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, Modeling for Verification, Probabilistic Weighted Automata, Weight Assignment Logic, Quantitative Simulation Games, On Omega-Languages Defined by Mean-Payoff Conditions, On the Supports of Recognizable Timed Series