an:06789954
Zbl 1378.68106
Ku??era, Anton??n; Mayr, Richard
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
EN
J. Comput. Syst. Sci. 91, 82-103 (2018).
00370790
2018
j
68Q45 68Q60 68Q85
pushdown automata; semantic equivalences; bisimulation
Summary: For a given process equivalence, we say that a process \(g\) is \textit{fully equivalent} to a process \(f\) of a transition system \(\mathcal{T}\) if \(g\) is equivalent to \(f\) and every reachable state of \(g\) is equivalent to some state of \(\mathcal{T}\). We propose a generic method for deciding full equivalence between pushdown processes and finite-state processes applicable to every process equivalence satisfying certain abstract conditions. Then, we show that these conditions are satisfied by bisimulation-like equivalences (including weak and branching bisimilarity), weak simulation equivalence, and weak trace equivalence, which are the main conceptual representatives of the linear/branching time spectrum. The list of particular results obtained by applying our method includes items which are first of their kind, and the associated upper complexity bounds are essentially optimal.