Multi-buffer simulations: Decidability and complexity
Multi-buffer simulations: Decidability and complexity
复制标题
多缓冲区模拟:可判定性和复杂性
DOI:
10.1016/j.ic.2018.09.008
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
E. Lozes
中科院分区:
文献类型:
--
作者:
M. Hutagalung;N. Hundeshagen;D. Kuske;M. Lange;E. Lozes
Multi-buffer simulation is a refinement of fair simulation between two nondeterministic Büchi automata (NBA). It is characterised by a game in which letters get pushed to and taken from FIFO buffers of bounded or unbounded capacity.Games with a single buffer approximate the PSPACE-complete language inclusion problem for NBA. With multiple buffers and a fixed mapping of letters to buffers these games approximate the undecidable inclusion problem between Mazurkiewicz trace languages.We study the decidability and complexity of multi-buffer simulations and obtain the following results: P-completeness for fixed bounded buffers, EXPTIME-completeness in case of a single unbounded buffer and high undecidability (in the analytic hierarchy) with two buffers of which at least one is unbounded. We also consider a variant in which the buffers are kept untouched or flushed and show PSPACE-completeness for the single-buffer case.
登录
查看更多内容
DOI:
--
发表时间:
1992
期刊:
Latin American Symposium on Theoretical Informatics
影响因子:
--
作者:
J. Sakarovitch
通讯作者:
J. Sakarovitch
DOI:
--
发表时间:
1987
期刊:
影响因子:
--
作者:
H. Rogers
通讯作者:
H. Rogers
DOI:
--
发表时间:
2016
期刊:
Cassting/SynCoP
影响因子:
--
作者:
M. Hutagalung;Norbert Hundeshagen;D. Kuske;M. Lange;É. Lozes
通讯作者:
É. Lozes
DOI:
--
发表时间:
2014
期刊:
International Conference on Automata and Formal Languages
影响因子:
--
作者:
M. Hutagalung;M. Lange;É. Lozes
通讯作者:
É. Lozes
DOI:
10.1145/4904.4993
发表时间:
1986-01
期刊:
J. ACM
影响因子:
--
作者:
D. Harel
通讯作者:
D. Harel