The following pages link to Arnaud Sangnier (Q896911):
Displayed 36 items.
- Parameterized verification of time-sensitive models of ad hoc network protocols (Q896913) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- How hard is it to verify flat affine counter systems with the finite monoid property? (Q1990502) (← links)
- Parameterized verification of algorithms for oblivious robots on a ring (Q2225474) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- Qualitative Analysis of VASS-Induced MDPs (Q2811349) (← links)
- Solving Parity Games on Integer Vectors (Q2842100) (← links)
- Taming Past LTL and Flat Counter Systems (Q2908489) (← links)
- (Q2957507) (← links)
- Adding Data Registers to Parameterized Networks with Broadcast (Q2968525) (← links)
- On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks (Q3000628) (← links)
- On the Verification of Timed Ad Hoc Networks (Q3172855) (← links)
- Weak Time Petri Nets Strike Back! (Q3184699) (← links)
- Mixing Coverability and Reachability to Analyze VASS with One Zero-Test (Q3401106) (← links)
- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic (Q3447697) (← links)
- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable (Q3557850) (← links)
- Parameterized Verification of Ad Hoc Networks (Q3584939) (← links)
- Reversal-Bounded Counter Machines Revisited (Q3599138) (← links)
- Towards Model-Checking Programs with Lists (Q3644794) (← links)
- Reachability in Networks of Register Protocols under Stochastic Schedulers (Q4598247) (← links)
- (Q4972731) (← links)
- (Q5013877) (← links)
- (Q5089313) (← links)
- Model-Checking Counting Temporal Logics on Flat Structures (Q5111643) (← links)
- The Complexity of Flat Freeze LTL (Q5111647) (← links)
- On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (Q5111899) (← links)
- Parameterized Verification of Broadcast Networks of Register Automata (Q5168517) (← links)
- Reachability in Timed Counter Systems (Q5179060) (← links)
- On the Complexity of Verifying Regular Properties on Flat Counter Systems, (Q5327431) (← links)
- Distributed local strategies in broadcast networks (Q5357693) (← links)
- Playing with Probabilities in Reconfigurable Broadcast Networks (Q5410669) (← links)
- Model Checking Freeze LTL over One-Counter Automata (Q5458381) (← links)
- From Time Petri Nets to Timed Automata: An Untimed Approach (Q5758109) (← links)
- (Q6187056) (← links)
- (Q6191001) (← links)