Hereditary History Preserving Simulation is Undecidable

Forfattere

  • Marcin Jurdzinski
  • Mogens Nielsen

DOI:

https://doi.org/10.7146/brics.v6i1.19501

Resumé

We show undecidability of hereditary history preserving simulation
for finite asynchronous transition systems by a reduction from the halting
problem of deterministic Turing machines. To make the proof more
transparent we introduce an intermediate problem of deciding the winner
in domino snake games. First we reduce the halting problem of deterministic
Turing machines to domino snake games. Then we show how to
model a domino snake game by a hereditary history simulation game on
a pair of finite asynchronous transition systems.

Downloads

Publiceret

1999-01-01

Citation/Eksport

Jurdzinski, M., & Nielsen, M. (1999). Hereditary History Preserving Simulation is Undecidable. BRICS Report Series, 6(1). https://doi.org/10.7146/brics.v6i1.19501

Nummer

Nr. 1 (1999): RS-1 Hereditary History Preserving Simulation is Undecidable

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).