Hereditary History Preserving Bisimilarity is Undecidable
DOI:
https://doi.org/10.7146/brics.v6i19.20076Resumé
We show undecidability of hereditary history preserving bisimilarityfor finite asynchronous transition systems by a reduction from the halting
problem of deterministic 2-counter machines. To make the proof more
transparent we introduce an intermediate problem of checking domino
bisimilarity for origin constrained tiling systems. First we reduce the
halting problem of deterministic 2-counter machines to origin constrained
domino bisimilarity. Then we show how to model domino bisimulations as
hereditary history preserving bisimulations for finite asynchronous transitions
systems. We also argue that the undecidability result holds for
finite 1-safe Petri nets, which can be seen as a proper subclass of finite
asynchronous transition systems.
Downloads
Publiceret
1999-01-19
Citation/Eksport
Jurdzinski, M., & Nielsen, M. (1999). Hereditary History Preserving Bisimilarity is Undecidable. BRICS Report Series, 6(19). https://doi.org/10.7146/brics.v6i19.20076
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- 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.
- 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.
- 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).