MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata
| Autor: | Bernd Becker, Holger Hermanns, Ralf Wimmer, Hassan Hatefi, Luis María Ferrer Fioriti, Bettina Braitling |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Theoretical computer science Single model TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Markov chain Computer science lcsh:Mathematics Stochastic game 020207 software engineering 0102 computer and information sciences 02 engineering and technology lcsh:QA1-939 01 natural sciences lcsh:QA75.5-76.95 Automaton Logic in Computer Science (cs.LO) Range (mathematics) 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Computer Science::Programming Languages lcsh:Electronic computers. Computer science Abstraction refinement Computer Science::Formal Languages and Automata Theory Abstraction (linguistics) |
| Zdroj: | Electronic Proceedings in Theoretical Computer Science, Vol 154, Iss Proc. QAPL 2014, Pp 48-63 (2014) QAPL |
| DOI: | 10.48550/arxiv.1406.2068 |
| Popis: | 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 refinement necessary. In this paper we present an abstraction and abstraction refinement technique for Markov automata, based on the game-based and menu-based abstraction of probabilistic automata. First experiments show that a significant reduction in size is possible using abstraction. Comment: In Proceedings QAPL 2014, arXiv:1406.1567 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|