Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Data-enriched models of computation

2019/35/B/ST6/02322

Keywords:

sets with atoms nominal sets orbit-finite sets inifnite-state systems decision problems formal verification register automata timed automata Petri nets with data

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.

Other projects carried out by the institution 

Principal investigator (from the host institution):

prof. Sławomir Grzegorz Lasota 

Number of co-investigators in the project: 8

Call: OPUS 18 - announced on 2019-09-16

Amount awarded: 979 500 PLN

Project start date (Y-m-d): 2020-07-22

Project end date (Y-m-d): 2024-12-21

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

Project status: Project completed

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.

Information in the final report

  • Publication in academic press/journals (2)
  • Articles in post-conference publications (16)
  1. Determinisability of register and timed automata
    Authors:
    Lorenzo Clemente ; Sławomir Lasota ; Radosław Piórkowski
    Academic press:
    Logical Methods in Computer Science (rok: 2022, tom: 18(2), strony: 9:1-9:37), Wydawca: Logical Methods in Computer Science e.V.
    Status:
    Published
    DOI:
    10.46298/LMCS-18(2:9)2022 - link to the publication
  2. Determinisability of register and timed automata
    Authors:
    Lorenzo Clemente ; Sławomir Lasota ; Radosław Piórkowski
    Academic press:
    Logical Methods in Computer Science (rok: 2022, tom: 18(2), strony: 9:1-9:37), Wydawca: Logical Methods in Computer Science e.V.
    Status:
    Published
    DOI:
    10.46298/LMCS-18(2:9)2022 - link to the publication
  1. Solvability of orbit-finite systems of linear equations
    Authors:
    Arka Ghosh, Piotr Hofman, Slawomir Lasota
    Conference:
    Proc. LICS 2022 (rok: 2022, tom: LICS 2022, strony: 45670), Wydawca: ACM
    Data:
    konferencja 2-5.08.2022
    Status:
    Published
    DOI:
    10.1145/3531130.3533333 - link to the publication
  2. Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
    Authors:
    B. Klin, S. Lasota, Sz. Toruńczyk
    Conference:
    Proc. FOSSACS 2021 (rok: 2021, tom: FOSSACS 2021, strony: 365-384), Wydawca: Springer-Verlag
    Data:
    konferencja 2021.03.27-31
    Status:
    Published
    DOI:
    10.1007/978-3-030-71995-1_19 - link to the publication
  3. Parikh's theorem for infinite alphabets
    Authors:
    P. Hofman, M. Juzepczuk, S. Lasota, M. Pattathurajan
    Conference:
    Proc. LICS 2021 (rok: 2021, tom: LICS 2021, strony: 45670), Wydawca: IEEE
    Data:
    konferencja 2021.06.29-2021.07-02
    Status:
    Published
    DOI:
    10.1109/LICS52264.2021.9470626 - link to the publication
  4. Parikh Images of Register Automata
    Authors:
    Slawomir Lasota, Mohnish Pattathurajan
    Conference:
    Proc. FSTTCS 2021 (rok: 2021, tom: FSTTCS 2021, strony: 50:1-50:14), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 2021.12.15-17
    Status:
    Published
    DOI:
    10.4230/LIPIcs.FSTTCS.2021.50 - link to the publication
  5. Parikh Images of Register Automata
    Authors:
    Slawomir Lasota, Mohnish Pattathurajan
    Conference:
    Proc. FSTTCS 2021 (rok: 2021, tom: FSTTCS 2021, strony: 50:1-50:14), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 2021.12.15-17
    Status:
    Published
    DOI:
    10.4230/LIPIcs.FSTTCS.2021.50 - link to the publication
  6. Determinizability of one-clock timed automata
    Authors:
    L. Clemente, S. Lasota, R. Piórkowski
    Conference:
    Proc. CONCUR 2020 (rok: 2020, tom: CONCUR 2020, strony: 42:1-42:17), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH
    Data:
    konferencja 2020.09.01-04
    Status:
    Published
    DOI:
    0.4230/LIPIcs.CONCUR.2020.42 - link to the publication
  7. Orbit-finite linear programming
    Authors:
    Arka Ghosh, Piotr Hofman, Sławomir Lasota
    Conference:
    Proc. LICS 2023 (rok: 2023, tom: LICS 2023, strony: 45671), Wydawca: ACM/IEEE
    Data:
    konferencja 26-29.06.2023
    Status:
    Published
    DOI:
    10.1109/LICS56636.2023.10175799 - link to the publication
  8. Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
    Authors:
    B. Klin, S. Lasota, Sz. Toruńczyk
    Conference:
    Proc. FOSSACS 2021 (rok: 2021, tom: FOSSACS 2021, strony: 365-384), Wydawca: Springer-Verlag
    Data:
    konferencja 2021.03.27-31
    Status:
    Published
    DOI:
    10.1007/978-3-030-71995-1_19 - link to the publication
  9. Parikh's theorem for infinite alphabets
    Authors:
    P. Hofman, M. Juzepczuk, S. Lasota, M. Pattathurajan
    Conference:
    Proc. LICS 2021 (rok: 2021, tom: LICS 2021, strony: 45670), Wydawca: IEEE
    Data:
    konferencja 2021.06.29-2021.07-02
    Status:
    Published
    DOI:
    10.1109/LICS52264.2021.9470626 - link to the publication
  10. Determinizability of one-clock timed automata
    Authors:
    L. Clemente, S. Lasota, R. Piórkowski
    Conference:
    Proc. CONCUR 2020 (rok: 2020, tom: CONCUR 2020, strony: 42:1-42:17), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH
    Data:
    konferencja 2020.09.01-04
    Status:
    Published
    DOI:
    0.4230/LIPIcs.CONCUR.2020.42 - link to the publication
  11. Parikh's theorem for infinite alphabets
    Authors:
    P. Hofman, M. Juzepczuk, S. Lasota, M. Pattathurajan
    Conference:
    Proc. LICS 2021 (rok: 2021, tom: LICS 2021, strony: 45670), Wydawca: IEEE
    Data:
    konferencja 2021.06.29-2021.07-02
    Status:
    Published
    DOI:
    10.1109/LICS52264.2021.9470626 - link to the publication
  12. Solvability of orbit-finite systems of linear equations
    Authors:
    Arka Ghosh, Piotr Hofman, Slawomir Lasota
    Conference:
    Proc. LICS 2022 (rok: 2022, tom: LICS 2022, strony: )
    Status:
    Published
    DOI:
    10.1145/3531130.3533333 - link to the publication
  13. Determinizability of one-clock timed automata
    Authors:
    L. Clemente, S. Lasota, R. Piórkowski
    Conference:
    Proc. CONCUR 2020 (rok: 2020, tom: CONCUR 2020, strony: 42:1-42:17), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH
    Data:
    konferencja 2020.09.01-04
    Status:
    Published
    DOI:
    0.4230/LIPIcs.CONCUR.2020.42 - link to the publication
  14. Parikh Images of Register Automata
    Authors:
    Slawomir Lasota, Mohnish Pattathurajan
    Conference:
    Proc. FSTTCS 2021 (rok: 2021, tom: FSTTCS 2021, strony: 50:1-50:14), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 2021.12.15-17
    Status:
    Published
    DOI:
    10.4230/LIPIcs.FSTTCS.2021.50 - link to the publication
  15. Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
    Authors:
    B. Klin, S. Lasota, Sz. Toruńczyk
    Conference:
    Proc. FOSSACS 2021 (rok: 2021, tom: FOSSACS 2021, strony: 365-384), Wydawca: Springer-Verlag
    Data:
    konferencja 2021.03.27-31
    Status:
    Published
    DOI:
    10.1007/978-3-030-71995-1_19 - link to the publication
  16. Solvability of orbit-finite systems of linear equations
    Authors:
    Arka Ghosh, Piotr Hofman, Slawomir Lasota
    Conference:
    Proc. LICS 2022 (rok: 2022, tom: LICS 2022, strony: 45670), Wydawca: ACM
    Data:
    konferencja 2-5.08.2022
    Status:
    Published
    DOI:
    10.1145/3531130.3533333 - link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy