Undecidability of domino games and hhp-bisimilarity-Reference-Cited by-同舟云学术

Undecidability of domino games and hhp-bisimilarity

Published:2003-08 Issue:2 Volume:184 Page:343-368
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Jurdziński Marcin,Nielsen Mogens,Srba Jiřı́

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference30 articles.

1. M.A. Bednarczyk, Hereditary history preserving bisimulations or what is the power of the future perfect in program logics, Technical report, Polish Academy of Sciences, Gdańsk, April (1991), Available at http://www.ipipan.gda.pl/ ̃marek

2. The Classical Decision Problem;Börger,1997

3. Higher dimensional transition systems;Luca Cattani,1996

4. Bisimulation equivalence is decidable for all context-free processes;Christensen;Information and Computation,1995

5. On the solvability of domino snake problems;Etzion-Petruschka;Theoretical Computer Science,1994

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimisation of event structures;Theoretical Computer Science;2022-10

2. Model Checking a Logic for True Concurrency;ACM Transactions on Computational Logic;2020-10-31

3. Automata for True Concurrency Properties;Lecture Notes in Computer Science;2018

4. Local Model Checking in a Logic for True Concurrency;Lecture Notes in Computer Science;2017

5. Partial-order Boolean games: informational independence in a logic-based model of strategic interaction;Synthese;2015-12-18