Projects funded by the NCN


Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Quantitative specifications: learning, algorithms and applications

2017/27/B/ST6/00299

Keywords:

finite automata specifications formal verification

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 Wrocławski, Wydział Matematyki i Informatyki

woj. dolnośląskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr Jan Otop 

Number of co-investigators in the project: 2

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

Amount awarded: 741 400 PLN

Project start date (Y-m-d): 2018-10-01

Project end date (Y-m-d): 2021-09-30

Project duration:: 36 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. Komputer przenośny (7 800 PLN)

Information in the final report

  • Publication in academic press/journals (2)
  • Articles in post-conference publications (6)
  1. Learning Deterministic Automata on Infinite Words
    Authors:
    Jakub Michaliszyn, Jan Otop
    Academic press:
    Artificial Intelligence , Wydawca: Elsevier
    Status:
    Accepted for publication
  2. Non-deterministic weighted automata evaluated over Markov chains.
    Authors:
    Jakub Michaliszyn, Jan Otop
    Academic press:
    Journal of Computer and System Sciences (rok: 2020, tom: 108, strony: 118-136), Wydawca: Elsevier
    Status:
    Published
  1. Approximate Learning of Limit-Average Automata
    Authors:
    Jakub Michaliszyn, Jan Otop
    Conference:
    International Conference on Concurrency Theory (CONCUR 2019) (rok: 2019, ), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
    Data:
    konferencja 26-31.08.2019
    Status:
    Published
  2. Learning Deterministic Automata on Infinite Words
    Authors:
    Jakub Michaliszyn and Jan Otop
    Conference:
    European Conference on Artificial Intelligence (ECAI 2020) (rok: 2020, ), Wydawca: IOS Press
    Data:
    konferencja 8-12.06.2020
    Status:
    Published
  3. Minimization of Limit-Average Automata
    Authors:
    Jakub Michaliszyn, Jan Otop
    Conference:
    International Joint Conference on Artificial Intelligence (IJCAI) (rok: 2021, ), Wydawca: ijcai.org
    Data:
    konferencja 2021-sierpień-19-27
    Status:
    Published
  4. Long-Run Average Behavior of Vector Addition Systems with States
    Authors:
    Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
    Conference:
    International Conference on Concurrency Theory (CONCUR 2019) (rok: 2019, ), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
    Data:
    konferencja 26-31.08.2019
    Status:
    Published
  5. Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
    Authors:
    Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
    Conference:
    International Conference on Concurrency Theory (CONCUR 2020) (rok: 2020, ), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
    Data:
    konferencja 1-4.09.2020
    Status:
    Published
  6. "Most of"' leads to undecidability: Failure of adding frequencies to LTL
    Authors:
    B. Bednarczyk, J. Michaliszyn
    Conference:
    International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2021) (rok: 2021, ), Wydawca: Springer
    Data:
    konferencja 27.03-1.04.2021
    Status:
    Published