Informatics Colloquium 1. 3. 2016: On selected verification problems, Petr Jančar
Informatics Colloquium 1. 3. 2016, 14:00 lecture room D2
prof. RNDr. Petr Jančar, CSc., Fakulta elektrotechniky a informatiky, VŠB-TUO
On selected verification problems
Abstract: The aim of the talk is to give a reflection on some verification problems that are famous for not being fully understood so far and to the research of which the author has also contributed. This includes the reachability problem for Petri nets, and especially the equivalence problem for first-order schemes or deterministic pushdown automata. The talk will highlight several ideas and structures, at a rather non-technical level, that have clarified some complicated issues. These ideas can be viewed as concrete instances of a more general approach to solving open problems, and the message of the talk thus might become wider than restricted just to the discussed verification problems.
prof. RNDr. Petr Jančar, CSc., Fakulta elektrotechniky a informatiky, VŠB-TUO
On selected verification problems
Abstract: The aim of the talk is to give a reflection on some verification problems that are famous for not being fully understood so far and to the research of which the author has also contributed. This includes the reachability problem for Petri nets, and especially the equivalence problem for first-order schemes or deterministic pushdown automata. The talk will highlight several ideas and structures, at a rather non-technical level, that have clarified some complicated issues. These ideas can be viewed as concrete instances of a more general approach to solving open problems, and the message of the talk thus might become wider than restricted just to the discussed verification problems.