Henry Sinclair-Banks

Henry in Chicago, October 2024

CeNT 03.108
Department of Mathematics, Informatics and Mechanics
University of Warsaw
Poland

Email: hsb (at) mimuw (dot) edu (dot) pl

About me

I am a postdoctoral researcher (PL: Adiunkt) at the University of Warsaw, Poland working under Dr. Wojciech Czerwiński's ERC grant “INFSYS” (EN/PL). You can find my employee page here.

I obtained a PhD in Computer Science from the University of Warwick, UK in 2024. I was supervised by Dr. Dmitry Chistikov and Dr. Marcin Jurdzinski. My thesis, titled “On the Complexity of Reachability Problems in Counter Systems”, was examined by Prof. Ranko Lazić (University of Warwick, UK) and Dr. Richard Mayr (University of Edinburgh, UK). Before that, I obtained a BSc in Discrete Mathematics from the University of Warwick, UK in 2020. You can find my old Warwick personal webpage here.

Research

My research interests are currently related to Automata, Complexity, and Logic and widely speaking my interests stem from the foundations of computer science. In particular, I have focussed on determining the complexity of decision problems for infinite-state systems, including: coverability and reachability in extended or restricted variants of both vector addition systems and Petri nets as well as membership, equivalence, and inclusion of counter nets. See my dblp, Google Scholar, and ORCiD.

My presentations are lised below (most notably, see my ICALP'23 best paper presentation and my FOCS'24 prerecorded conference talk).

Papers

The Tractability Border of Reachability in Simple Vector Addition Systems with States
Dmitry Chistikov, Wojciech Czerwiński, Filip Mazowiecki, Łukasz Orlikowski, Henry Sinclair-Banks, and Karol Węgrzycki.
In FOCS'24, DOI. Conference presentation video.
Full Version. Abstract.

Invariants for One-Counter Automata with Disequality Tests
Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, and Nicolas Waldburger.
In CONCUR'24, DOI.
Full Version. Abstract.

Dimension-Minimality and Primality of Counter Nets
Shaull Almagor, Guy Avni, Henry Sinclair-Banks, and Asaf Yeshurun.
In FoSSaCS'24, DOI.
Full Version. Abstract.

Acyclic Petri and Workflow Nets with Resets
Dmitry Chistikov, Wojciech Czerwiński, Piotr Hofman, Filip Mazowiecki, and Henry Sinclair-Banks.
In FSTTCS'23, DOI. Conference presentation video.
Full Version. Abstract.

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality
Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, and Karol Węgrzycki.
In ICALP'23, DOI. Conference presentation video. Awarded ICALP'23 Track B Best Paper.
Full Version. Abstract.
Accepted, subject to minor revisions, to JACM.

Coverability in 2-VASS with One Unary Counter is in NP
Filip Mazowiecki, Henry Sinclair-Banks, and Karol Węgrzycki.
In FoSSaCS'23, DOI. Conference presentation video.
Full Version. Abstract.

Events

Upcoming: Liverpool Verification Seminar (S).

ISTA Group Seminar (S), FOCS'24 (P), Oxford Verification Seminar (S), Highlights'24 (S), CONFEST'24 (A) including CONCUR'24 (P), KIT Algorithms & Complexity Seminar (S), Infinite Automata 2024 (A), ETAPS'24 (A) including FoSSaCS'24 (P), IRIF Verification Seminar (S), FSTTCS'23 (P), LaBRI Formal Methods Seminar (S), Summer School Marktoberdorf 2023 (A), Highlights'23 (S), Autobóz'23 (A), ICALP'23 (P) including WORReLL'23 (A), ETAPS'23 (A) including FoSSaCS'23 (P) and EMW'23 (A), OFCOUSE Student Talk Series (S), Autobóz'22 (A), ICALP'22 (A) including Trends in Arithmetic Theories (A), Highlights'22 (S), MOVEP'22 (S), HALG'22 (A), BCTCS'22 (A), ICALP'21 (V), Automata in the Wild 2021 (A), CAV'20 (A) including VMW'20 (A), ICALP'20 (A) and LICS'20 (A) including INFINITY'20 (A) and LMW'20 (A), MOVEP'20 (A).

Key: (A)ttendee, (P)aper, (S)peaker, (V)olunteer.

Presentations

All videos of presentations are on my YouTube page (except the FOCS'24 prerecorded conference talk).

Teaching

I was a Senior Graduate Teaching Assistant at the University of Warwick, UK during my PhD from October 2020 to March 2024.

*I also delivered a (48-minute) lecture about polynomial space Turing machines, as part of the Complexity of Algorithms (CS301) course, for third year undergraduate students.