Zobrazeno 1 - 10
of 127
pro vyhledávání: '"Antonín Kučera"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 1 (2014)
We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with k limit-average functions, in the expectation o
Externí odkaz:
https://doaj.org/article/5c82e3a2ec574981abefbcfbf3fdfbcf
Repair mechanisms are important within resilient systems to maintain the system in an operational state after an error occurred. Usually, constraints on the repair mechanisms are imposed, e.g., concerning the time or resources required (such as energ
Externí odkaz:
http://arxiv.org/abs/1707.03223
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031223365
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fc24e93afa9ff0fa1bac81914a8a0ca
https://doi.org/10.1007/978-3-031-22337-2_18
https://doi.org/10.1007/978-3-031-22337-2_18
Javier Esparza received his primary degree in Theoretical Physics and in 1990 his PhD in Computer Science from the University of Zaragoza. After positions at the University of Hildesheim, the University of Edinburgh, and the Technical University of M
Autor:
Miroslav Chodil, Antonín Kučera
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783030865924
FCT
FCT
We give a sufficient condition under which every finite-satisfiable formula of a given PCTL fragment has a model with at most doubly exponential number of states (consequently, the finite satisfiability problem for the fragment is in \(\mathbf{2}\tex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bc3673cb9b06209314ef6d5f325c443
https://doi.org/10.1007/978-3-030-86593-1_10
https://doi.org/10.1007/978-3-030-86593-1_10
Publikováno v:
LICS
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.676-688
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.676-688
The termination complexity of a given VASS is a function L assigning to every n the length of the longest non-terminating computation initiated in a configuration with all counters bounded by n. We show that for every VASS with demonic nondeterminism
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::535974488861934c2463068239639c4a
https://hal.archives-ouvertes.fr/hal-03052592
https://hal.archives-ouvertes.fr/hal-03052592
Autor:
Richard Mayr, Antonín Kučera
Publikováno v:
Kučera, A & Mayr, R 2018, ' A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata ', Journal of Computer and System Sciences, vol. 91, pp. 82-103 . https://doi.org/10.1016/j.jcss.2017.09.004
We propose a generic method for deciding semantic equivalences between pushdown automata and finite-state automata. The abstract part of the method is applicable to every process equivalence which is a right PDA congruence. Practical usability of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53afc6e0310826029415f0da47e58939
https://doi.org/10.1016/j.jcss.2017.09.004
https://doi.org/10.1016/j.jcss.2017.09.004
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783030317836
ATVA
ATVA
A probabilistic vector addition system with states (pVASS) is a finite state Markov process augmented with non-negative integer counters that can be incremented or decremented during each state transition, blocking any behaviour that would cause a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44a545f5ff043855680431d541ba6ac4
https://doi.org/10.1007/978-3-030-31784-3_27
https://doi.org/10.1007/978-3-030-31784-3_27
Publikováno v:
LICS
In this interactive paper, which you should preferably read connected to the Internet, the Black Ninjas introduce you to population protocols, a fundamental model of distributed computation, and to recent work by the authors and their colleagues on t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb28a48099524052600e83728b0f2f46
https://doi.org/10.1145/3209108.3209110
https://doi.org/10.1145/3209108.3209110
Publikováno v:
IJCAI
We propose an algorithm for constructing efficient patrolling strategies in the Internet environment, where the protected targets are nodes connected to the network and the patrollers are software agents capable of detecting/preventing undesirable ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ff29a296c74cb3fa3eb0a592fa67df2
https://doi.org/10.24963/ijcai.2018/17
https://doi.org/10.24963/ijcai.2018/17