MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata
Markov automata combine continuous time, probabilistic transitions, and nondeterminism in a single model. They represent an important and powerful way to model a wide range of complex real-life systems. However, such models tend to be large and difficult to handle, making abstraction and abstraction...
Main Authors: | Bettina Braitling, Luis María Ferrer Fioriti, Hassan Hatefi, Ralf Wimmer, Bernd Becker, Holger Hermanns |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2014-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1406.2068v1 |
Similar Items
-
Analysis of Timed and Long-Run Objectives for Markov Automata
by: Dennis Guck, et al.
Published: (2014-09-01) -
Abstract automata /
by: 458509 Starke, Peter H.
Published: (1972) -
PASS: Abstraction Refinement for Infinite Probabilistic Models
by: Hahn, E, et al.
Published: (2010) -
Megara and Tripodiscus
by: Kent J. Rigsby
Published: (2004-11-01) -
A game-based abstraction-refinement framework for Markov decision processes
by: Kattenbelt, M, et al.
Published: (2010)