Zobrazeno 1 - 10
of 86
pro vyhledávání: '"BÉRARD, Béatrice"'
Publikováno v:
EPTCS 326, 2020, pp. 33-49
The problem of distributed synthesis is to automatically generate a distributed algorithm, given a target communication network and a specification of the algorithm's correct behavior. Previous work has focused on static networks with an a priori fix
Externí odkaz:
http://arxiv.org/abs/2002.07545
We study the synthesis problem for systems with a parameterized number of processes. As in the classical case due to Church, the system selects actions depending on the program run so far, with the aim of fulfilling a given specification. The difficu
Externí odkaz:
http://arxiv.org/abs/1910.14294
Publikováno v:
In Information and Computation November 2022 289 Part B
Given a probabilistic transition system (PTS) $\cal A$ partially observed by an attacker, and an $\omega$-regular predicate $\varphi$over the traces of $\cal A$, measuring the disclosure of the secret $\varphi$ in $\cal A$ means computing the probabi
Externí odkaz:
http://arxiv.org/abs/1510.04316
Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. Her
Externí odkaz:
http://arxiv.org/abs/1504.04541
Interrupt Timed Automata (ITA) is an expressive timed model, introduced to take into account interruptions, according to levels. Due to this feature, this formalism is incomparable with Timed Automata. However several decidability results related to
Externí odkaz:
http://arxiv.org/abs/1409.2408
Autor:
Bérard, Béatrice, Mullins, John
Information flow properties express the capability for an agent to infer information about secret behaviours of a partially observable system. In a language-theoretic setting, where the system behaviour is described by a language, we define the class
Externí odkaz:
http://arxiv.org/abs/1409.0871
Opacity is a generic security property, that has been defined on (non probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external obser
Externí odkaz:
http://arxiv.org/abs/1407.4225
Publikováno v:
Formal Methods in System Design 40, 1 (2012) 41-87
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment. While the reachability problem is undecidable for
Externí odkaz:
http://arxiv.org/abs/1203.6453