Zmiana języka

Projects search

Data-enriched models of computation

2019/35/B/ST6/02322

Keywords

Descriptors

  • ST6_004: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna, algorytmy kwantowe

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

Voivodeship: mazowieckie

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
2020-07-22
Project end date
2024-10-21
Project duration
51 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.

Information in the final report

Publication in academic press/journals (4)

  1. Playing Stochastically in Weighted Timed Games to Emulate Memory

    Authors:
    Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
    Academic press:
    Logical Methods in Computer Science (year: 2025, volume: 21(1), pages: 19:1-19:61), Publisher: Logical Methods in Computer Science
    Status:
    Published
    DOI:
    10.48550/arXiv.2105.00984 – link to the publication

  2. Decidability of One-Clock Weighted Timed Games with Arbitrary Weights

    Authors:
    Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
    Academic press:
    Logical Methods in Computer Science (year: 2025, volume: 21(1), pages: 8:1-8:45), Publisher: Logical Methods in Computer Science
    Status:
    Published
    DOI:
    10.46298/lmcs-21(1:8)2025 – link to the publication

  3. Determinisability of register and timed automata

    Authors:
    Lorenzo Clemente ; Sławomir Lasota ; Radosław Piórkowski
    Academic press:
    Logical Methods in Computer Science (year: 2022, volume: 18(2), pages: 9:1-9:37), Publisher: Logical Methods in Computer Science e.V.
    Status:
    Published
    DOI:
    10.46298/LMCS-18(2:9)2022 – link to the publication

  4. Orbit-finite linear programming

    Authors:
    Arka Ghosh, Sławomir Lasota
    Academic press:
    Journal of the ACM (year: 2025, volume: 71 (1), pages: 14246), Publisher: ACM
    Status:
    Published
    DOI:
    10.1145/3703909 – link to the publication

Articles in post-conference publications (7)

  1. Determinizability of one-clock timed automata

    Authors:
    L. Clemente, S. Lasota, R. Piórkowski
    Conference:
    Proc. CONCUR 2020 (year: 2020, volume: CONCUR 2020, pages: 42:1-42:17), Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH
    Date:
    conference 2020.09.01-04
    Status:
    Published
    DOI:
    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 (year: 2021, volume: FOSSACS 2021, pages: 365-384), Publisher: Springer-Verlag
    Date:
    conference 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 (year: 2021, volume: LICS 2021, pages: 46035), Publisher: IEEE
    Date:
    conference 2021.06.29-2021.07-02
    Status:
    Published
    DOI:
    10.1109/LICS52264.2021.9470626 – link to the publication

  4. Synthesis of Robust Optimal Real-Time Systems

    Authors:
    Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
    Conference:
    MFCS 2024 (year: 2024, volume: MFCS 2024, pages: 74:1-74:15), Publisher: LIPICS
    Date:
    conference 26-30.08.2024
    Status:
    Published
    DOI:
    10.4230/LIPIcs.MFCS.2024.74 – link to the publication

  5. Orbit-finite linear programming

    Authors:
    Arka Ghosh, Piotr Hofman, Sławomir Lasota
    Conference:
    Proc. LICS 2023 (year: 2023, volume: LICS 2023, pages: 46036), Publisher: ACM/IEEE
    Date:
    conference 26-29.06.2023
    Status:
    Published
    DOI:
    10.1109/LICS56636.2023.10175799 – link to the publication

  6. Solvability of orbit-finite systems of linear equations

    Authors:
    Arka Ghosh, Piotr Hofman, Slawomir Lasota
    Conference:
    Proc. LICS 2022 (year: 2022, volume: LICS 2022, pages: 46035), Publisher: ACM
    Date:
    conference 2-5.08.2022
    Status:
    Published
    DOI:
    10.1145/3531130.3533333 – link to the publication

  7. Parikh Images of Register Automata

    Authors:
    Slawomir Lasota, Mohnish Pattathurajan
    Conference:
    Proc. FSTTCS 2021 (year: 2021, volume: FSTTCS 2021, pages: 50:1-50:14), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Date:
    conference 2021.12.15-17
    Status:
    Published
    DOI:
    10.4230/LIPIcs.FSTTCS.2021.50 – link to the publication

« New search

Graphic design and implementation: Jakub Piotrowski