Travelled to:1 × Cyprus
1 × France
1 × Germany
1 × Hungary
1 × Japan
1 × Latvia
1 × Portugal
1 × United Kingdom
Collaborated with:S.Demri A.K.Dhar N.Bertrand G.Delzanno P.Fournier G.Zavattaro R.Lazic D.D'Aprile S.Donatelli J.Sproston B.König J.Stückrath
Talks about:counter (4) system (3) ltl (3) automata (2) network (2) model (2) freez (2) decid (2) check (2) time (2)
Person: Arnaud Sangnier
DBLP: Sangnier:Arnaud
Contributed to:
2014
2013
2012
2012201120102008
2007Wrote 8 papers:
- FoSSaCS-2014-BertrandFS #configuration management #game studies #network
- Playing with Probabilities in Reconfigurable Broadcast Networks (NB, PF, AS), pp. 134–148.
- ICALP-v2-2013-DemriDS #complexity #on the #verification
- On the Complexity of Verifying Regular Properties on Flat Counter Systems, (SD, AKD, AS), pp. 162–173.
- IJCAR-2012-DemriDS #ltl
- Taming Past LTL and Flat Counter Systems (SD, AKD, AS), pp. 179–193.
- 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-DelzannoSZ #ad hoc #clique #network #on the #power of #verification
- On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks (GD, AS, GZ), pp. 441–455.
- FoSSaCS-2010-DemriS #decidability #ltl #model checking
- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable (SD, AS), pp. 176–190.
- FoSSaCS-2008-DemriLS #automaton #ltl #model checking
- Model Checking Freeze LTL over One-Counter Automata (SD, RL, AS), pp. 490–504.
- TACAS-2007-DAprileDSS #approach #automaton #petri net
- From Time Petri Nets to Timed Automata: An Untimed Approach (DD, SD, AS, JS), pp. 216–230.