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 × Czech Republic
1 × Estonia
1 × Greece
1 × Hungary
1 × Iceland
1 × Italy
1 × Portugal
1 × Spain
1 × Switzerland
2 × Poland
2 × United Kingdom
4 × USA
Collaborated with:
N.Markey T.Brihaye A.Petit K.G.Larsen N.Bertrand P.Reynier F.Chevalier D.D'Souza V.Forejt J.Ouaknine J.Worrell G.Behrmann E.Fleury C.Baier O.Sankur S.Haddad M.Colange B.Bérard V.Jugé R.Brenguier M.Ummels A.Stainer R.Pelánek P.Madhusudan C.Dufourd M.Größer
Talks about:
time (17) automata (13) reachabl (3) model (3) check (3) game (3) control (2) analysi (2) system (2) robust (2)

Person: Patricia Bouyer

DBLP DBLP: Bouyer:Patricia

Contributed to:

FOSSACS 20122012
ICALP (2) 20122012
ICALP (2) 20112011
ICALP (2) 20092009
FoSSaCS 20082008
ICALP (2) 20082008
LICS 20082008
FoSSaCS 20072007
LICS 20072007
ICALP (2) 20062006
LICS 20062006
FoSSaCS 20052005
TACAS 20042004
CAV 20032003
TACAS 20032003
CAV 20002000
ICALP 19991999
CAV (1) 20162016
CSL 20182018

Wrote 20 papers:

FoSSaCS-2012-BouyerBMU #concurrent #game studies #order
Concurrent Games with Ordered Objectives (PB, RB, NM, MU), pp. 301–315.
ICALP-v2-2012-BouyerMS #approach #automaton #game studies #reachability #robust
Robust Reachability in Timed Automata: A Game-Based Approach (PB, NM, OS), pp. 128–140.
ICALP-v2-2011-BertrandBBS #automaton #problem
Emptiness and Universality Problems in Timed Automata with Positive Frequency (NB, PB, TB, AS), pp. 246–257.
ICALP-v2-2009-BaierBBB #automaton #question
When Are Timed Automata Determinizable? (CB, NB, PB, TB), pp. 43–54.
ICALP-v2-2009-BouyerF #game studies #probability #reachability
Reachability in Stochastic Timed Games (PB, VF), pp. 103–114.
FoSSaCS-2008-BouyerMR #analysis #automaton #robust
Robust Analysis of Timed Automata via Channel Machines (PB, NM, PAR), pp. 157–171.
ICALP-B-2008-BouyerMOW #complexity #model checking #on the #realtime
On Expressiveness and Complexity in Real-Time Model Checking (PB, NM, JO, JW), pp. 124–135.
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-2007-BouyerLM #automaton #model checking
Model-Checking One-Clock Priced Timed Automata (PB, KGL, NM), pp. 108–122.
LICS-2007-BouyerMOW #cost analysis
The Cost of Punctuality (PB, NM, JO, JW), pp. 109–120.
ICALP-v2-2006-BouyerHR #automaton #petri net #power of #sequence
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences (PB, SH, PAR), pp. 420–431.
LICS-2006-BouyerBC #hybrid
Control in o-minimal Hybrid Systems (PB, TB, FC), pp. 367–378.
FoSSaCS-2005-BouyerCD #automaton #fault #using
Fault Diagnosis Using Timed Automata (PB, FC, DD), pp. 219–233.
TACAS-2004-BehrmannBLP #abstraction #automaton #bound
Lower and Upper Bounds in Zone Based Abstractions of Timed Automata (GB, PB, KGL, RP), pp. 312–326.
Timed Control with Partial Observability (PB, DD, PM, AP), pp. 180–192.
TACAS-2003-BehrmannBFL #analysis #automaton #verification
Static Guard Analysis in Timed Automata Verification (GB, PB, EF, KGL), pp. 254–277.
CAV-2000-BouyerDFP #automaton #question
Are Timed Automata Updatable? (PB, CD, EF, AP), pp. 464–479.
ICALP-1999-BouyerP #automaton #composition
Decomposition and Composition of Timed Automata (PB, AP), pp. 210–219.
CAV-2016-BouyerCM #automaton #reachability
Symbolic Optimal Reachability in Weighted Timed Automata (PB, MC, NM), pp. 513–530.
CSL-2018-BerardBJ #bisimulation #finite
Finite Bisimulations for Dynamical Systems with Overlapping Trajectories (BB, PB, VJ), p. 17.

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.