Publications


2020

  1. Wojciech Czerwiński, Diego Figueira, Piotr Hofman. Universality Problem for Unambiguous VASS. International Conference on Concurrency Theory (CONCUR), Sep 2020, Vienna, Austria. 〈hal〉.
  2. Diego Figueira, Anirban Majumdar, M. Praveen. Playing with repetitions in data words using energy games. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2020, 16 (3), pp.1. 〈hal〉.

2019

  1. Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre. On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019, 15 (4), ⟨10.23638/LMCS-15(4:15)2019⟩. 〈hal〉.
  2. Alain Finkel, Ekanshdeep Gupta. The Well Structured Problem for Presburger Counter Machines. 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), Arkadev Chattopadhyay; Paul Gastin, Dec 2019, Mumbai, India. 〈hal〉.
  3. Petr Jančar, Jérôme Leroux, Grégoire Sutre. Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2019, 169 (1-2), pp.123-150. ⟨10.3233/FI-2019-1841⟩. 〈hal〉.
  4. Jérôme Leroux, Jean-François Raskin. Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019, Bordeaux, France, 2-3rd September 2019. Electronic Proceedings in Theoretical Computer Science, 305, 2019, ⟨10.4204/EPTCS.305⟩. 〈hal〉.
  5. Alain Finkel, M. Praveen. Verification of Flat FIFO Systems. CONCUR 2019, Aug 2019, AMSTERDAM, Netherlands. 〈hal〉.
  6. Diego Figueira. Co-finiteness of VASS coverability languages. 2019. 〈hal〉.
  7. Sylvain Schmitz. The Parametric Complexity of Lossy Counter Machines. ICALP 2019, Jul 2019, Patras, Greece. pp.129:1--129:15, ⟨10.4230/LIPIcs.ICALP.2019.129⟩. 〈hal〉.
  8. Jérôme Leroux, Sylvain Schmitz. Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--13, ⟨10.1109/LICS.2019.8785796⟩. 〈hal〉.
  9. Petr Jancar, Sylvain Schmitz. Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--12, ⟨10.1109/LICS.2019.8785848⟩. 〈hal〉.
  10. Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, Filip Mazowiecki. The reachability problem for Petri nets is not elementary. Proceedings of the 51st Annual Symposium on Theory of Computing, 2019, Phoenix, AZ, USA, June 23-26, 2019, Jun 2019, Phoenix, United States. pp.24-33, ⟨10.1145/3313276.3316369⟩. 〈hal〉.
  11. Alain Finkel, Serge Haddad, Igor Khmelnitsky. Coverability and Termination in Recursive Petri Nets, Couverture et Terminaison dans les réseaux de Petri Récursifs. Petri Nets 2019 / ACSD 2019 - 40th International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2019, Aachen, Germany. 〈hal〉.
  12. Jérôme Leroux. Petri Net Reachability Problem (Invited Talk). 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019, Aachen, Germany. 〈hal〉.

2018

  1. Alain Finkel, Jérôme Leroux, Grégoire Sutre. Reachability for Two-Counter Machines with One Test and One Reset. FSTTCS 2018 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.31:1-31:14, ⟨10.4230/LIPIcs.FSTTCS.2018.31⟩. 〈hal〉.
  2. Vincent Penelle, Sylvain Salvati, Grégoire Sutre. On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. FSTTCS 2018 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.44:1-44:20, ⟨10.4230/LIPIcs.FSTTCS.2018.44⟩. 〈hal〉.
  3. Thomas Geffroy, Jérôme Leroux, Grégoire Sutre. Occam's Razor applied to the Petri net coverability problem. Theoretical Computer Science, Elsevier, 2018, 750, pp.38-52. ⟨10.1016/j.tcs.2018.04.014⟩. 〈hal〉.
  4. Alain Finkel, Etienne Lozes. Synchronizability of Communicating Finite State Machines is not Decidable. 2018. 〈hal〉.
  5. Diego Figueira, M. Praveen. Playing with Repetitions in Data Words Using Energy Games. Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209154⟩. 〈hal〉.
  6. Petr Jančar, Jérôme Leroux, Grégoire Sutre. Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States. PETRI NETS 2018 - 39th International Conference on the Application and Theory of Petri Nets and Concurrency, Jun 2018, Bratislava, Slovakia. pp.184-203, ⟨10.1007/978-3-319-91268-4_10⟩. 〈hal〉.
  7. Jérôme Leroux. Polynomial Vector Addition Systems With States. 2018. 〈hal〉.
  8. Jean Goubault-Larrecq. Spaces with no Infinite Discrete Subspace. Topology Proceedings, Auburn University Mathematics Dept., In press. 〈hal〉.
  9. Jérôme Leroux. Polynomial Vector Addition Systems With States. 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.134⟩. 〈hal〉.

2017

  1. Michael Blondin, Alain Finkel, Jean Goubault-Larrecq. Forward Analysis for WSTS, Part III: Karp-Miller Trees. 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.16⟩. 〈hal〉.
  2. Serge Haddad, Michael Blondin, Christoph Haase, Alain Finkel. The Logical View on Continuous Petri Nets. ACM Transactions on Computational Logic, Association for Computing Machinery, 2017, 18 (3). 〈hal〉.