Decidability of bisimulation equivalence for normed pushdown processes

被引：16

作者：

Stirling, C ^{[1
]}

机构：

[1] Univ Edinburgh, Dept Comp Sci, Edinburgh EH9 3JZ, Midlothian, Scotland

来源：

THEORETICAL COMPUTER SCIENCE | 1998年 / 195卷 / 02期

关键词：

bisimulation equivalence; decidability; infinite state systems; pushdown process;

D O I：

10.1016/S0304-3975(97)00216-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We prove that bisimulation equivalence is decidable for normed pushdown processes. (C) 1998-Elsevier Science B.V. All rights reserved.

引用

收藏

页码：113 / 131

页数：19

相关论文

共 36 条

[31] Decidability of Well Quasi-Order and Atomicity for Equivalence Relations Under Embedding Orderings
Ironmonger, V.
Ruskuc, N.
[J]. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2024, 41 (03): : 761 - 786
[32] Deciding bisimulation-like equivalences with finite-state processes
Jancar, P
Kucera, A
Mayr, R
[J]. THEORETICAL COMPUTER SCIENCE, 2001, 258 (1-2) : 409 - 433
[33] Determining asynchronous test equivalence for probabilistic processes
Bhateja, Puneet
[J]. INFORMATION PROCESSING LETTERS, 2022, 177
[34] On decidability and model checking for a first order modal logic for value-passing processes
Rui Xue
Huimin Lin
[J]. Science in China Series F, 2003, 46 : 45 - 59
[35] On decidability and model checking for a first order modal logic for value-passing processes
Xue, R
Lin, HM
[J]. SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2003, 46 (01): : 45 - 59
[36] On decidability and model checking for a first order modal logic for value-passing processes
薛锐
林惠民
[J]. ScienceinChina(SeriesF:InformationSciences), 2003, (01) : 45 - 59

← 1 2 3 4 →