Zobrazeno 1 - 10
of 144
pro vyhledávání: '"Brihaye, Thomas"'
We present a mathematical setting for attack-defense trees, a classic graphical model to specify attacks and countermeasures. We equip attack-defense trees with (trace) language semantics allowing to have an original dynamic interpretation of counter
Externí odkaz:
http://arxiv.org/abs/2312.00458
Autor:
Brihaye, Thomas, Goeminne, Aline
We study two-player multi-weighted reachability games played on a finite directed graph, where an agent, called P1, has several quantitative reachability objectives that he wants to optimize against an antagonistic environment, called P2. In this set
Externí odkaz:
http://arxiv.org/abs/2308.09625
In this paper, we deepen the study of two-player Stackelberg games played on graphs in which Player $0$ announces a strategy and Player $1$, having several objectives, responds rationally by following plays providing him Pareto-optimal payoffs given
Externí odkaz:
http://arxiv.org/abs/2308.09443
We propose two market designs for the optimal day-ahead scheduling of energy exchanges within renewable energy communities. The first one implements a cooperative demand side management scheme inside a community where members objectives are coupled t
Externí odkaz:
http://arxiv.org/abs/2305.04085
Publikováno v:
EPTCS 370, 2022, pp. 162-177
Security is a subject of increasing attention in our actual society in order to protect critical resources from information disclosure, theft or damage. The informal model of attack trees introduced by Schneier, and widespread in the industry, is adv
Externí odkaz:
http://arxiv.org/abs/2209.10322
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept was extended to more general stochastic transition systems (STSs), all
Externí odkaz:
http://arxiv.org/abs/2009.13152
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 3 (August 9, 2022) lmcs:6764
Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the cost of spending time in a state and executing an action, respectively). The goals of the players a
Externí odkaz:
http://arxiv.org/abs/2009.03074
Decisiveness has proven to be an elegant concept for denumerable Markov chains: it is general enough to encompass several natural classes of denumerable Markov chains, and is a sufficient condition for simple qualitative and approximate quantitative
Externí odkaz:
http://arxiv.org/abs/2008.10426
Autor:
Brihaye, Thomas, Goeminne, Aline
We study multiplayer turn-based timed games with reachability objectives. In particular, we are interested in the notion of subgame perfect equilibrium (SPE). We prove that deciding the constrained existence of an SPE in this setting is EXPTIME-compl
Externí odkaz:
http://arxiv.org/abs/2006.10491