#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2012

2017

- This year (4)
- Last 5 years (9)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David A. Basin, Vincent Jugé, Felix Klaedtke, Eugen Zalinescu
- ACM Trans. Inf. Syst. Secur.
- 2012

We revisit Schneider’s work on policy enforcement by execution monitoring. We overcome limitations of Schneider’s setting by distinguishing between system actions that are controllable by an enforcement mechanism and those actions that are only observable, that is, the enforcement mechanism sees them but cannot prevent their execution. For this… (More)

- Patricia Bouyer, Vincent Jugé, Nicolas Markey
- ArXiv
- 2016

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of two-player parity games over graphs of bounded tree-width, where updates may add or delete edges, or change the owner or color of states. We show that this problem is in DynFO (with LOGSPACE precomputation); this is… (More)

- Patricia Bouyer, Vincent Jugé
- FoSSaCS
- 2017

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete edges. We show a strong dichotomy between such problems, based on the size of the Dyck alphabet. Some of them are P-complete… (More)

- Vincent Jugé
- IJAC
- 2017

- Vincent Jugé
- 2016

Let A and V be two alphabets. A word on A is a finite sequence a = a1a2 · · ·ak of elements of A. The elements ai are called the letters of the word a, and the integer k is the length of a. For all elements α ∈ A, we denote by |a|α the cardinality of the set {i : ai = α}, i.e. number of occurrences of the letter α in the word a. We also denote by A∗ the set… (More)

- Patricia Bouyer, Vincent Jugé, Nicolas Markey
- ArXiv
- 2017

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic secondorder formula over evolving subgraphs of a fixed maximal graph having bounded tree-width; here the subgraph evolves by losing or gaining edges (from the maximal graph). We show that… (More)

- David A. Basin, Vincent Jugé, MINES ParisTech, Felix Klaedtke, Eugen Zalinescu
- 2013

We revisit Schneider’s work on policy enforcement by execution monitoring. We overcome limitations of Schneider’s setting by distinguishing between system actions that are controllable by an enforcement mechanism and those actions that are only observable, that is, the enforcement mechanism sees them but cannot prevent their execution. For this refined… (More)

- Samy Abbes, Sébastien Gouëzel, Vincent Jugé, Jean Mairesse
- 2016

We aim at studying the asymptotic properties of typical positive braids, respectively positive dual braids. Denoting by μk the uniform distribution on positive (dual) braids of length k, we prove that the sequence (μk)k converges to a unique probability measure μ∞ on infinite positive (dual) braids. The key point is that the limiting measure μ∞ has a… (More)

- Patricia Bouyer, Serge Haddad, Vincent Jugé
- CONCUR
- 2017

Computing steady-state distributions in infinite-state stochastic systems is in general a very difficult task. Product-form Petri nets are those Petri nets for which the steady-state distribution can be described as a natural product corresponding, up to a normalising constant, to an exponentiation of the markings. However, even though some classes of nets… (More)

- ‹
- 1
- ›