Convex language semantics for nondeterministic probabilistic automata

DOI10.1007/978-3-030-02508-3_25MaRDI QIDQ1623161zbMATH OpenOpenAlexFDO

Authors Gerco van Heerdt, Justin Hsu, Joël Ouaknine, Alexandra Silva

Publication date 23 November 2018

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Probabilistic Weighted Automata
• Probabilistic ω-automata
• Non-deterministic Weighted Automata on Random Words
• Probabilistic automata of bounded ambiguity
• Probabilistic automata over infinite words: expressiveness, efficiency, and decidability

Cited in

(7)

• A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
• Non-deterministic weighted automata evaluated over Markov chains
• Nondeterministic complexity in subclasses of convex languages
• scientific article; zbMATH DE number 7015236 (Why is no real title available?)
• The theory of traces for systems with nondeterminism, probability, and termination
• Convex language semantics for nondeterministic probabilistic automata
• On piecewise affine reachability with Bellman operators

This page was built for publication: Convex language semantics for nondeterministic probabilistic automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623161)