46 citations · 72 across the 9 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CR2015★ 1 cited
Probabilistic Opacity in Refinement-Based Modeling
Béatrice Bérard, Olga Kouchnarenko, John Mullins +1
Given a probabilistic transition system (PTS) partially observed by an attacker, and an -regular predicate over the traces of , measuring the disclosure of t…
cs.FL2015★ 3 cited
Polynomial Interrupt Timed Automata
Béatrice Bérard, Serge Haddad, Claudine Picaronny +2
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…