MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata
نویسندگان
چکیده
منابع مشابه
MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata
ion in general is based on a partition P = {B1,B2, . . . ,Bn} of the state space. The original or concrete states are lumped together into abstract states, defined by the blocks Bi ∈P . For PA, both gameand menu-based abstraction use these blocks Bi as player 1 states (i. e. V1 = P). In game-based abstraction [18] for PA player 2 states in V2 represent sets of concrete states that have the same...
متن کاملA game-based abstraction-refinement framework for Markov decision processes
In the field of model checking, abstraction refinement has proved to be an extremely successful methodology for combating the state-space explosion problem. However, little practical progress has been made in the setting of probabilistic verification. In this paper we present a novel abstraction-refinement framework for Markov decision processes (MDPs), which are widely used for modelling and v...
متن کاملAn Abstraction Refinement Technique for Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop
ion Inputs A , h {h = abstraction function} Ŝ := ∅, →̂ := ∅ {M̂ = (Ŝ, ŝ0, →̂)} foreach l ∈ L do Ŝ := Ŝ ∪ {h(l)} end for ŝ0 := h(l0) foreach (l1, a, g, r, l2) ∈ T do →:=→ ∪{(h(l1), h(l2))} end for return M̂
متن کاملFixpoint Guided Abstraction Refinement for Alternating Automata
In this paper, we develop and evaluate two new algorithms for checking emptiness of alternating automata. These algorithms build on previous works. First, they rely on antichains to efficiently manipulate the state-spaces underlying the analysis of alternating automata. Second, they are abstract algorithms with built-in refinement operators based on techniques that exploit information computed ...
متن کاملAutomatic Abstraction Refinement for Timed Automata
We present a fully automatic approach for counterexample guided abstraction refinement of real-time systems modelled in a subset of timed automata. Our approach is implemented in the MOBY/RT tool environment, which is a CASE tool for embedded system specifications. Verification in MOBY/RT is done by constructing abstractions of the semantics in terms of timed automata which are fed into the mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.154.4