BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Greece
1 × Hungary
1 × Italy
1 × Japan
1 × Poland
1 × Spain
1 × Switzerland
2 × France
2 × Germany
2 × USA
Collaborated with:
P.Schnoebelen C.Baier A.Stainer P.Bouyer T.Brihaye A.Sangnier M.Größer T.Jéron M.Krichen P.Fournier J.Fearnley S.Schewe S.Pinchinat J.Raclet B.Genest H.Gimbert E.Fabre S.Haar S.Haddad L.Hélouët G.Delzanno B.König J.Stückrath
Talks about:
automata (6) time (6) system (3) decid (3) game (3) probabilist (2) stochast (2) problem (2) probabl (2) infinit (2)

Person: Nathalie Bertrand

DBLP DBLP: Bertrand:Nathalie

Facilitated 2 volumes:

QAPL 2015Ed
QAPL 2014Ed

Contributed to:

FoSSaCS 20142014
QAPL 20132013
CSL 20122012
RTA 20122012
FOSSACS 20112011
ICALP (2) 20112011
TACAS 20112011
ICALP (2) 20092009
LATA 20092009
LICS 20092009
FoSSaCS 20082008
LICS 20082008
FoSSaCS 20032003

Wrote 14 papers:

FoSSaCS-2014-BertrandFHHH #probability
Active Diagnosis for Probabilistic Systems (NB, EF, SH, SH, LH), pp. 29–42.
FoSSaCS-2014-BertrandFS #configuration management #game studies #network
Playing with Probabilities in Reconfigurable Broadcast Networks (NB, PF, AS), pp. 134–148.
QAPL-2013-BertrandS #automaton #game studies #infinity #probability
Solving Stochastic Büchi Games on Infinite Decisive Arenas (NB, PS), pp. 116–131.
CSL-2012-BertrandFS #bound #satisfiability
Bounded Satisfiability for PCTL (NB, JF, SS), pp. 92–106.
RTA-2012-BertrandDKSS #decidability #graph transformation #on the #reachability
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (NB, GD, BK, AS, JS), pp. 101–116.
FoSSaCS-2011-BertrandSJK #approach #automaton #game studies
A Game Approach to Determinize Timed Automata (NB, AS, TJ, MK), pp. 245–259.
ICALP-v2-2011-BertrandBBS #automaton #problem
Emptiness and Universality Problems in Timed Automata with Positive Frequency (NB, PB, TB, AS), pp. 246–257.
TACAS-2011-BertrandJSK #automaton #nondeterminism #testing
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata (NB, TJ, AS, MK), pp. 96–111.
ICALP-v2-2009-BaierBBB #automaton #question
When Are Timed Automata Determinizable? (CB, NB, PB, TB), pp. 43–54.
LATA-2009-BertrandPR #consistency #refinement #specification
Refinement and Consistency of Timed Modal Specifications (NB, SP, JBR), pp. 152–163.
LICS-2009-BertrandGG #decidability #game studies #probability
Qualitative Determinacy and Decidability of Stochastic Games with Signals (NB, BG, HG), pp. 319–328.
FoSSaCS-2008-BaierBG #automaton #on the #probability #problem
On Decision Problems for Probabilistic Büchi Automata (CB, NB, MG), pp. 287–301.
LICS-2008-BaierBBBG #automaton #infinity #model checking
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (CB, NB, PB, TB, MG), pp. 217–226.
FoSSaCS-2003-BertrandS #decidability #model checking
Model Checking Lossy Channels Systems Is Probably Decidable (NB, PS), pp. 120–135.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.