Tight game abstractions of probabilistic automata

DOI10.1007/978-3-662-44584-6_39MaRDI QIDQ3190145zbMATH OpenOpenAlexWikidataFDO

Authors Falak Sher Vira, Joost-Pieter Katoen

Publication date 15 September 2014

Published in CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44584-6_39

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) 2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Recommendations

• Modal stochastic games. Abstraction-refinement of probabilistic automata
• Compositional abstraction techniques for probabilistic automata
• Game-Based Probabilistic Predicate Abstraction in PRISM
• Stochastic games for verification of probabilistic timed automata
• Verification and refutation of probabilistic specifications via games

Cited in

(4)

• Compositional abstraction techniques for probabilistic automata
• Space-bounded probabilistic game automata
• Modal stochastic games. Abstraction-refinement of probabilistic automata
• Game-Based Probabilistic Predicate Abstraction in PRISM

This page was built for publication: Tight game abstractions of probabilistic automata

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