Challenging Problems in Infinite-State Systems

Project Information

INFSYS

Grant agreement ID: 950398

DOI 10.3030/950398

EC signature date 11 September 2020

Start date 1 March 2021

End date 28 February 2026

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost € 1 340 406,00

EU contribution € 1 340 406,00

Coordinated by

UNIWERSYTET WARSZAWSKI
Poland

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (18)

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality

Author(s): Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
Published in: Proceedings of ICALP B 2023, Issue 261, 2023, Page(s) 131:1--131:20
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2023.131

Solvability of orbit-finite systems of linear equations

Author(s): Arka Ghosh, Piotr Hofman, Sławomir Lasota
Published in: Proceedings of LICS 2022, 2022, Page(s) 11:1--11:13
Publisher: ACM
DOI: 10.1145/3531130.3533333

Orbit-finite linear programming

Author(s): Arka Ghosh, Piotr Hofman, Slawomir Lasota
Published in: Proceedings of LICS 2023, 2023
Publisher: IEEE
DOI: 10.1109/lics56636.2023.10175799

Complexity of Spatial Games

Author(s): Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda
Published in: Proceedings of FSTTCS 2022, Issue 250, 2022, Page(s) 11:1 - 11:14
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.fsttcs.2022.11

Multiplicity Problems on Algebraic Series and Context-Free Grammars

Author(s): Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell
Published in: Proceedings of LICS 2023, 2023
Publisher: IEEE
DOI: 10.1109/lics56636.2023.10175707

Parikh Automata over Infinite Words

Author(s): Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
Published in: Proceedings of FSTTCS 2022, Issue 250, 2022, Page(s) 40:1--40:20
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.fsttcs.2022.40

Reachability in Vector Addition Systems is Ackermann-complete

Author(s): Wojciech Czerwiński, Łukasz Orlikowski
Published in: Proceedings of FOCS 2022, 2021, Page(s) 1229--1240
Publisher: IEEE
DOI: 10.1109/focs52979.2021.00120

The boundedness and zero isolation problems for weighted automata over nonnegative rationals

Author(s): Wojciech Czerwiński, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland
Published in: Proceedings of LICS 2022, 2022, Page(s) 15:1--15:13
Publisher: ACM
DOI: 10.1145/3531130.3533336

On Rational Recursive Sequences

Author(s): Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
Published in: Proceedings of STACS 2023, Issue 254, 2023, Page(s) 24:1--24:21
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2023.24

History-Deterministic Parikh Automata

Author(s): Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
Published in: Proceedings of CONCUR 2023, Issue 279, 2023, Page(s) 31:1--31:16
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2023.31

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)

Author(s): Laure Daviaud, David Purser
Published in: Proceedings of LICS 2023, 2023
Publisher: IEEE
DOI: 10.1109/lics56636.2023.10175798

Monus Semantics in Vector Addition Systems with States

Author(s): Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
Published in: Proceeding of CONCUR 2023, Issue 279, 2023, Page(s) 10:1--10:18
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.concur.2023.10

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable

Author(s): Wojciech Czerwiński, Piotr Hofman
Published in: Proceedings of CONCUR 2022, Issue 243, 2022, Page(s) 16:1--16:22
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.concur.2022.16

Parikh Images of Register Automata

Author(s): Slawomir Lasota, Mohnish Pattathurajan
Published in: Proceedings of FSTTCS 2021, Issue 213, 2021, Page(s) 50:1 - 50:14
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.fsttcs.2021.50

Fast Termination and Workflow Nets

Author(s): Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
Published in: Proceedings of CAV 2023, Issue 13964, 2023, Page(s) 132--155
Publisher: Springer
DOI: 10.1007/978-3-031-37706-8_7

Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes

Author(s): Wojciech Czerwiński, Łukasz Orlikowski
Published in: Proceedings of LICS 2022, 2022, Page(s) 40:1--40:12
Publisher: ACM
DOI: 10.1145/3531130.3533357

Involved VASS Zoo

Author(s): Wojciech Czerwiński
Published in: Proceedings of CONCUR 2022, Issue 243, 2022, Page(s) 5:1--5:13, ISBN 978-3-95977-246-4
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.concur.2022.5

Coverability in 2-VASS with One Unary Counter is in NP

Author(s): Filip Mazowiecki, Henry Sinclair-Banks, Karol Węgrzycki
Published in: Proceedings of FoSSaCS 2023, Issue 13992, 2023, Page(s) 196--217
Publisher: Springer
DOI: 10.1007/978-3-031-30829-1_10