Arnaud Sangnier

Available identifiers

zbMath Open sangnier.arnaudMaRDI QIDQ896911

List of research outcomes

Publication	Date of Publication	Type
On the satisfiability of local first-order logics with data	2024-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q6191001	2024-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q6187056	2024-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q5089313	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5013877	2021-12-03	Paper
Parameterized verification of algorithms for oblivious robots on a ring	2021-02-08	Paper
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems	2020-05-27	Paper
Model-Checking Counting Temporal Logics on Flat Structures	2020-05-27	Paper
The Complexity of Flat Freeze LTL	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q4972731	2019-11-26	Paper
How hard is it to verify flat affine counter systems with the finite monoid property?	2018-10-25	Paper
Equivalence between model-checking flat counter systems and Presburger arithmetic	2018-06-05	Paper
Reachability in Networks of Register Protocols under Stochastic Schedulers	2017-12-19	Paper
Distributed local strategies in broadcast networks	2017-09-12	Paper
Adding Data Registers to Parameterized Networks with Broadcast	2017-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q2957507	2017-01-26	Paper
Qualitative Analysis of VASS-Induced MDPs	2016-06-10	Paper
Parameterized verification of time-sensitive models of ad hoc network protocols	2015-12-15	Paper
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic	2015-10-28	Paper
Taming past LTL and flat counter systems	2015-06-01	Paper
Reachability in Timed Counter Systems	2015-03-19	Paper
Parameterized Verification of Broadcast Networks of Register Automata	2014-07-07	Paper
Playing with Probabilities in Reconfigurable Broadcast Networks	2014-04-16	Paper
Solving Parity Games on Integer Vectors	2013-08-12	Paper
On the Complexity of Verifying Regular Properties on Flat Counter Systems,	2013-08-07	Paper
Taming Past LTL and Flat Counter Systems	2012-09-05	Paper
On the Verification of Timed Ad Hoc Networks	2011-10-07	Paper
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks	2011-05-19	Paper
Parameterized Verification of Ad Hoc Networks	2010-08-31	Paper
Model checking memoryful linear-time logics over one-counter automata	2010-05-27	Paper
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable	2010-04-27	Paper
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test	2010-01-28	Paper
Towards Model-Checking Programs with Lists	2009-11-12	Paper
Weak Time Petri Nets Strike Back!	2009-10-22	Paper
Reversal-Bounded Counter Machines Revisited	2009-02-03	Paper
Model Checking Freeze LTL over One-Counter Automata	2008-04-11	Paper
From Time Petri Nets to Timed Automata: An Untimed Approach	2007-09-03	Paper

Research outcomes over time

This page was built for person: Arnaud Sangnier