Zobrazeno 1 - 10 of 58 pro vyhledávání: '"Forejt, V"'
1
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
Autor: Forejt, V, Jancar, P, Kiefer, S, Worrell, J
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without eps
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa0cc54201699faab2516ff6efebf932
Zobrazit plný text záznamu
2
Reachability in Stochastic Timed Games
Autor: Bouyer, P, Forejt, V, Albers, S, Marchetti-Spaccamela, A, Matias, Y, Nikoletseas, SE, Thomas, W
Publikováno v: Automata, Languages and Programming ISBN: 9783642029295
ICALP (2)
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-time Markov decision processes. We focus on the reachability problem f
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d741f9061de1b1469066f2bb32b825f8
https://doi.org/10.1007/978-3-642-02930-1_9
Zobrazit plný text záznamu
4
INCREMENTAL RUNTIME VERIFICATION OF PROBABLISTIC SYSTEMS
Autor: Forejt, V, Kwiatkowska, M, Parker, D, Qu, H, Ujma, M
Probabilistic verification techniques have been proposed for runtime analysis of adaptive software systems, with the verification results being used to steer the system so that it satisfies certain Quality-of-Service requirements. Since systems evolv
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::72e90ad7a5c7225188e1326b396baf2c
http://ora.ox.ac.uk/objects/uuid:0afc930c-5280-4a7d-991f-4148cccb8e68
Zobrazit plný text záznamu
5
Automated Verification Techniques for Probabilistic Systems
Autor: Forejt, V, Kwiatkowska, MZ, Norman, G, Parker, D, Bernardo, M, Issarny, V
Publikováno v: SFM. 6659
This tutorial provides an introduction to probabilistic model checking, a technique for automatically verifying quantitative properties of probabilistic systems. We focus on Markov decision processes (MDPs), which model both stochastic and nondetermi
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1064::7ce7b051bcbf73fb11678d2078c92cf8
http://ora.ox.ac.uk/objects/uuid:e3fbeeba-2762-4f73-b331-fc25790a8532
Zobrazit plný text záznamu
6
Quantitative Multi-objective Verification for Probabilistic Systems
Autor: Forejt, V, Kwiatkowska, MZ, Norman, G, Parker, D, Qu, H, Abdulla, PA, Leino, KRM
Publikováno v: TACAS. 6605
We present a verification framework for analysing multiple quantitative objectives of systems that exhibit both nondeterministic and stochastic behaviour. These systems are modelled as probabilistic automata, enriched with cost or reward structures t
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1064::c4d49e30f6c1f042a1556ed294c74ffb
http://ora.ox.ac.uk/objects/uuid:19c1bcc0-15ef-40cb-8c84-ddd13388cd14
Zobrazit plný text záznamu
8
Expected Reachability-Time Games
Autor: Forejt, V, Kwiatkowska, MZ, Norman, G, Trivedi, A, Chatterjee, K, Henzinger, TA
Publikováno v: FORMATS. 6246
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respectively, the expected time to reach a target. These games are concurren
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1064::3ac4e80097892442cd99100c71de3a18
http://ora.ox.ac.uk/objects/uuid:d2d0ae1a-3dfa-4250-9e6a-4d829c153219
Zobrazit plný text záznamu
9
Continuous-Time Stochastic Games with Time-Bounded Reachability
Autor: Brázdil, T, Forejt, V, Krcál, J, Kretínský, J, Kucera, A, Kannan, R, Kumar, KN
Publikováno v: Information and Computation
We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optim
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5e3be31bc3855ab8333bbff0c10384f
http://ora.ox.ac.uk/objects/uuid:4e122b58-0da9-4d6a-8003-70ebeb473c0b
Zobrazit plný text záznamu
10
Conference
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
Autor: Brazdil, T., Brozek, V., Chatterjee, K., Forejt, V., Kucera, A.
Publikováno v: 2011 26th Annual IEEE Symposium on Logic in Computer Science (LICS); 2011, p33-42, 10p
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje