Verifying identical communicating processes is undecidable
type: Item
instance of: scholarly article
title: Verifying identical communicating processes is undecidable
zbMATH Open document ID: 0902.68127
DOI: 10.1016/S0304-3975(96)00026-6
author: Alain Finkel
author: Pierre McKenzie
published in: Theoretical Computer Science
publication date: 1998-10-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1213165
zbMATH Keywords: boundedness
zbMATH Keywords: reachability tree finiteness
MaRDI profile type: Publication
cites work: On Communicating Finite-State Machines
cites work: Unreliable channels are easier to verify than perfect channels
cites work: Q3992423
cites work: Q5592246
cites work: An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
cites work: Q4325545
cites work: Automates a file
full work available at URL: s0304-3975(96)00026-6
OpenAlex ID: W1996288883
description: scientific article; zbMATH DE number 1213165