Infinite Automata |
Presentations |
Charity |
Coffee |
CeNT 03.108
Department of Mathematics, Informatics and Mechanics
University of Warsaw
Poland
Email: hsb (at) mimuw (dot) edu (dot) pl
I am a postdoctoral researcher (PL: Adiunkt) at the University of Warsaw, Poland working under Dr. Wojciech Czerwiński's ERC grant “INFSYS”. I'm the main applicant of “Weighted Automata meets Matrix Reachability meets Noncommutative Power Series” (see “Wyniki konkursu”), an IDUB Thematic Research Program project (funded by the University of Warsaw). 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.
My research interests, widely speaking, stem from the foundations of computer science; they are related to automata, complexity, and logic. In particular, I have mainly focussed on reachability problems in infinite-state systems (including vector addition systems, Petri and workflow nets, weighted automata, and counter nets). For example, I have worked on determining the exact complexity of coverability in vector addition systems and determining the complexity of reachability in flat VASS and 1-VASS with disequality tests.
Awarded ICALP'23 Track B Best Paper for the contribution: Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality.
My presentations are lised below my papers (most notably, see my ICALP'23 best paper presentation and my FOCS'24 prerecorded conference talk).
I am proud to be supervising Jakub Kaszycki's master's thesis (at the institute of Mathematics, Informatics and Mechanics at the University of Warsaw, Poland).
Here a list of my (fantastic) coauthors that has been sorted lexicographically by the number of coauthored papers then alphabetically by surname.
See my dblp, Google Scholar, and ORCiD.
A Note on the Parameterised Complexity of Coverability in Vector Addition Systems
Michał Pilipczuk,
Sylvain Schmitz, and
Henry Sinclair-Banks.
Accepted to
IPEC'25.
Abstract.
A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
Yousef Shakiba,
Henry Sinclair-Banks, and
Georg Zetzsche.
In
LICS'25,
DOI.
Conference presentation video.
Full Version,
Abstract.
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
Journal of the ACM (August 2025),
DOI.
Kudos advertisement article.
In
ICALP'23,
DOI.
Conference presentation video.
Awarded ICALP'23 Track B Best Paper.
Full Version.
Abstract.
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.
Highlights'25 (S), Young Researchers Forum 2025 (S), Weighted Automata Rock Workshop (O), LICS'25 (P) including LMW'25 (S), SJTU BASICS Group Seminar (S), SAMSA Workshop (O), Automata in the Wild 2025 (S), 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, (O)rganiser, (P)aper, (S)peaker, (V)olunteer.
On this subpage, you can find a list of all of my presentations including links to video recordings, slide decks, and abstracts.
In the first term of the Polish academic year, I will be organising and lecturing the Infinite Automata (1000-2M22AN) course in the University of Warsaw, Poland. Details including lectured topics and exercise questions can be found on this subpage. I also list my previous teaching dutings at the University of Warwick, UK. you can find a list of all of my presentations including links to video recordings, slide decks, and abstracts.
On this subpage, I maintain a list of my favourite coffee shops.