MOVES Seminar 20 Jan, 2011, 10:00

Decidability and Complexity of Bisimulation and Model-Checking over Infinite-State Systems

The first part of the thesis deals with branching bisimulation equivalence (by Rob van Glabeek and Peter Weijland) between finite-state systems and several infinite-state systems. The infinite systems considered are Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). We present polynomial-time algorithms for both the two problems.

The second part deals with the model-checking problem of EGF-logic, which consists of conventional logical operators, the CTL notation EF and the CTL* notation EGF. The underlying model is pushdown systems and Basic Parallel Processes. For this part PSPACE algorithms are presented, with which we can show that both the two problems are PSPACE-complete.