Projects funded by the NCN


Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Automatic analysis of concurrent systems

2017/27/B/ST6/02093

Keywords:

formal models of concurrent systems vector addition systems Petri nets regular separability coverabilty,

Descriptors:

  • ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms

Panel:

ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution :

Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki

woj. mazowieckie

Other projects carried out by the institution 

Principal investigator (from the host institution):

prof. Sławomir Lasota 

Number of co-investigators in the project: 6

Call: OPUS 14 - announced on 2017-09-15

Amount awarded: 768 800 PLN

Project start date (Y-m-d): 2018-07-20

Project end date (Y-m-d): 2021-12-19

Project duration:: 41 months (the same as in the proposal)

Project status: Project settled

Project description

Download the project description in a pdf file

Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Equipment purchased [PL]

  1. Komputery przenośne (17 040 PLN)

Information in the final report

  • Publication in academic press/journals (5)
  • Articles in post-conference publications (5)
  1. Investigating Reversibility of Steps in Petri Nets
    Authors:
    David de Frutos-Escrig, Maciej Koutny, Łukasz Mikulski
    Academic press:
    Fundamenta Informaticae (rok: 2021, tom: 183(1-2), strony: 67-96), Wydawca: PTM
    Status:
    Published
    DOI:
    10.3233/FI-2021-2082 - link to the publication
  2. The Reachability Problem for Petri Nets is Not Elementary
    Authors:
    W. Czerwiński, S. Lasota, R. Lazic, J. Leroux, F. Mazowiecki
    Academic press:
    Journal of the ACM (rok: 2021, tom: 68(1), strony: 7:1-7:28), Wydawca: Association for Computing Machinery
    Status:
    Published
    DOI:
    10.1145/3422822 - link to the publication
  3. A lower bound for the coverability problem in acyclic pushdown VAS
    Authors:
    M. Englert, P.Hofman, S. Lasota, R. Lazic, J. Leroux, J. Straszyński
    Academic press:
    Information Processing Letters (rok: 2021, tom: 167, strony: 106079), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.ipl.2020.106079 - link to the publication
  4. Investigating Reversibility of Steps in Petri Nets
    Authors:
    David de Frutos-Escrig, Maciej Koutny, Łukasz Mikulski
    Academic press:
    Fundamenta Informaticae (rok: 2021, tom: 183(1-2), strony: 67-96), Wydawca: PTM
    Status:
    Published
    DOI:
    10.3233/FI-2021-2082 - link to the publication
  5. Algebraic Structure of Step Traces and Interval Traces
    Authors:
    Ryszard Janicki, Łukasz Mikulski
    Academic press:
    Fundamenta Informaticae (rok: 2020, tom: 175, strony: 253-280), Wydawca: PTM
    Status:
    Published
    DOI:
    10.3233/FI-2020-1956 - link to the publication
  1. New Pumping Technique for 2-Dimensional VASS
    Authors:
    W. Czerwiński, S. Lasota, C. Löding, R. Piórkowski
    Conference:
    MFCS 2019 (rok: 2019, ), Wydawca: Leibniz International Proceedings in Informatics
    Data:
    konferencja 26-30.09.2019
    Status:
    Published
  2. Reachability in fixed dimension vector addition systems with states
    Authors:
    W. Czerwiński, S. Lasota, R. Lazic, J. Leroux, F. Mazowiecki
    Conference:
    CONCUR (rok: 2020, ), Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
    Data:
    konferencja 1-4.-09.2020
    Status:
    Published
  3. The Reachability Problem for Petri Nets is Not Elementary
    Authors:
    W. Czerwiński, S. Lasota, R. Lazic, J. Leroux, F. Mazowiecki
    Conference:
    STOC 2019 - 51st ACM Symposium on Theory of Computing (rok: 2019, ), Wydawca: ACM
    Data:
    konferencja 23-26.06.2019
    Status:
    Published
  4. Timed Games and Deterministic Separability
    Authors:
    L.Clemente, S.Lasota, R.Piórkowski
    Conference:
    ICALP 2020 (rok: 2020, ), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
    Data:
    konferencja 2020.07.8-11
    Status:
    Published
  5. Improved lower bounds for reachability in vector addition systems
    Authors:
    W. Czerwiński, S. Lasota, Ł. Orlikowski
    Conference:
    ICALP 2021 (rok: 2021, ), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
    Data:
    konferencja 12-16.07.2021
    Status:
    Published