"[177C29D50EAA]" . "208" . "0890-5401" . . . "14330" . . . "pushdown automata; verification; simulation; bisimulation"@en . . "On the Complexity of Checking Semantic Equivalences between Pushdown Processes and Finite-state Processes" . "276831" . "P(1M0545), Z(MSM0021622419)" . . . "On the Complexity of Checking Semantic Equivalences between Pushdown Processes and Finite-state Processes"@en . "RIV/00216224:14330/10:00043945!RIV11-MSM-14330___" . . "2"^^ . "Information and Computation" . "2"^^ . "000278980700002" . "February" . . "Ku\u010Dera, Anton\u00EDn" . . . . . "RIV/00216224:14330/10:00043945" . "NL - Nizozemsko" . "Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong simulation/bisimulation, while weak simulation/bisimulation abstracts from internal tau-actions. We study the computational complexity of checking these strong and weak semantic preorders/equivalences between pushdown processes and finite-state processes."@en . "Mayr, Richard" . . . "Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong simulation/bisimulation, while weak simulation/bisimulation abstracts from internal tau-actions. We study the computational complexity of checking these strong and weak semantic preorders/equivalences between pushdown processes and finite-state processes." . . "25"^^ . . "On the Complexity of Checking Semantic Equivalences between Pushdown Processes and Finite-state Processes" . "Mayr, Richard" . "On the Complexity of Checking Semantic Equivalences between Pushdown Processes and Finite-state Processes"@en . .