Fröschle, Sibylle B.Sibylle B.Fröschle2021-12-172021-12-172004-12-29Information Processing Letters 93 (6): 289-293 (2005-03-31)http://hdl.handle.net/11420/11320The decidability border of the weaker hereditary history preserving bisimilarity is discussed. A domino system D is universally encoded by a finite system N(D) such that the building of a domino snake can be faithfully mimicked by a special pattern of forwards and backtrack moves in the unfolding structure of N(D). The domino bisimilarity is undecidable by a reduction from the halting problem of 2-counter machines. Theoretical investigation suggests that finding the borderline is difficult.en1872-611920046289293ElsevierBisimulation gamesConcurrencyInfinite-space verificationTrue-concurrencyInformatikJournal Article10.1016/j.ipl.2004.11.010Other