Undecidability of domino games and hhp-bisimilarity.
type: Item
instance of: scholarly article
title: Undecidability of domino games and hhp-bisimilarity.
zbMATH Open document ID: 1054.68094
DOI: 10.1016/S0890-5401(03)00064-6
author: Marcin Jurdziński
author: Mogens Nielsen
author: Jiří Srba
published in: Information and Computation
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1967139
zbMATH Keywords: hereditary history preserving bisimilarity
zbMATH Keywords: finite elementary net systems
zbMATH Keywords: 1-safe Petri nets
MaRDI profile type: Publication
cites work: Q5691140
cites work: Bisimulation equivalence is decidable for all context-free processes
cites work: On the solvability of domino snake problems
cites work: Q4499199
cites work: Q4941914
cites work: Q3975146
cites work: Domino Games and Complexity
cites work: Undecidable equivalences for basic process algebra
cites work: Algebraic laws for nondeterminism and concurrency
cites work: A polynomial algorithm for deciding bisimilarity of normed context-free processes
cites work: Deciding true concurrency equivalences on safe, finite nets
cites work: Bisimulation from open maps
cites work: Q4501547
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: Q4251912
cites work: A calculus of communicating systems
cites work: Q5590814
cites work: Q4847022
cites work: Petri nets and bisimulation
cites work: Three Partition Refinement Algorithms
cites work: Q3907077
cites work: Q3805922
cites work: Bisimulation, modal logic and model checking games
cites work: On the Ehrenfeucht-Fraïssé game in theoretical computer science
cites work: Q4036588
cites work: Q4857386
full work available at URL: s0890-5401(03)00064-6
OpenAlex ID: W2029027766
description: scientific article; zbMATH DE number 1967139