Non-deterministic Weighted Automata on Random Words

DOI10.4230/LIPIcs.CONCUR.2018.10OpenAlexW2889322199MaRDI QIDQ5009422

Jan Otop, Jakub Michaliszyn

Publication date: 4 August 2021

Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2018.10

zbMATH Keywords

expected valueweighted automataquantitative verification

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Unnamed Item, Quantitative Automata under Probabilistic Semantics, Non-deterministic weighted automata evaluated over Markov chains

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Handbook of weighted automata
• Strategy synthesis for multi-dimensional quantitative objectives
• Model measuring for discrete and hybrid systems
• Reasoning about online algorithms with weighted automata
• Quantitative languages
• Approximate Determinization of Quantitative Automata
• The Cost of Traveling between Languages
• What’s Decidable about Weighted Automata?
• A Survey of Stochastic Games with Limsup and Liminf Objectives
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• The complexity of probabilistic verification
• Handbook of Model Checking
• Markov Chains and Unambiguous Büchi Automata
• Quantitative Automata under Probabilistic Semantics
• Predicate abstraction and refinement for verifying multi-threaded programs
• Percentile queries in multi-dimensional Markov decision processes