The article summarizes the results of the author in the area of automated verification of systems and concurrency theory. These results are concerning the computational complexity of equivalence checking problems. The main aim of the paper is to present intuitive non-formal overview of these results.
The article summarizes the results of the author in the area of automated verification of systems and concurrency theory. These results are concerning the computational complexity of equivalence checking problems. The main aim of the paper is to present intuitive non-formal overview of these results. (en)