Jerome Leroux

About Jerome Leroux

Jerome Leroux, With an exceptional h-index of 29 and a recent h-index of 18 (since 2020), a distinguished researcher at Université de Bordeaux, specializes in the field of Formal Methods, Logique, Counter Systems.

His recent articles reflect a diverse array of research interests and contributions to the field:

A State-of-the-Art Karp-Miller Algorithm Certified in Coq

On the Home-Space Problem for Petri Nets

New Lower Bounds for Reachability in Vector Addition Systems

48th International Symposium on Mathematical Foundations of Computer Science

The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets

LIPIcs, Volume 272, MFCS 2023, Complete Volume

Compiling Petri Net Mutual Reachability in Presburger

State complexity of protocols with leaders

Jerome Leroux Information

University

Position

CNRS researcher, LaBRI, France

Citations(all)

2825

Citations(since 2020)

1082

Cited By

2211

hIndex(all)

29

hIndex(since 2020)

18

i10Index(all)

53

i10Index(since 2020)

31

Email

University Profile Page

Google Scholar

Jerome Leroux Skills & Research Interests

Formal Methods

Logique

Counter Systems

Top articles of Jerome Leroux

A State-of-the-Art Karp-Miller Algorithm Certified in Coq

2024/4/4

On the Home-Space Problem for Petri Nets

2024/3/20

New Lower Bounds for Reachability in Vector Addition Systems

arXiv preprint arXiv:2310.09008

2023/10/13

48th International Symposium on Mathematical Foundations of Computer Science

2023/8

The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets

2023

LIPIcs, Volume 272, MFCS 2023, Complete Volume

2023

Compiling Petri Net Mutual Reachability in Presburger

arXiv preprint arXiv:2210.09931

2022/10/18

State complexity of protocols with leaders

2022/7/20

Semilinear Home-space is Decidable for Petri Nets

arXiv preprint arXiv:2207.02697

2022/7/6

Sedimentology of a hypertidal point bar (Mont‐Saint‐Michel Bay, north‐western France) revealed by combining lidar time‐series and sedimentary core data

Sedimentology

2022/4

The reachability problem for Petri nets is not primitive recursive

2022/2/7

New Algorithms for Combinations of Objectives using Separating Automata

arXiv preprint arXiv:2109.08322

2021/9/17

Depicting architecture and sedimentology of a hypertidal point bar through Lidar and sedimentary-core data

2021/6/21

Flat Petri Nets (Invited Talk)

2021/6/16

A lower bound for the coverability problem in acyclic pushdown VAS

Information Processing Letters

2021/4/1

The reachability problem for Petri nets is not elementary

Journal of the ACM (JACM)

2020/12/20

Reachability in two-dimensional vector addition systems with states: One test is for free

LICS 2015–Logic in Computer Science

2015

When reachability meets grzegorczyk

2020/7/8

Efficient analysis of VASS termination complexity

2020/7/8

Reachability in fixed dimension vector addition systems with states

arXiv preprint arXiv:2001.04327

2020/1/13

See List of Professors in Jerome Leroux University(Université de Bordeaux)