Verifying lossy channel systems has nonprimitive recursive complexity.
type: Item
instance of: scholarly article
title: Verifying lossy channel systems has nonprimitive recursive complexity.
zbMATH Open document ID: 1043.68016
DOI: 10.1016/S0020-0190(01)00337-4
author: Yanyan Li
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 1856417
zbMATH Keywords: Verification of infinite-state systems
zbMATH Keywords: Communication protocols
zbMATH Keywords: Program correctness
zbMATH Keywords: Formal methods
MaRDI profile type: Publication
cites work: Q4536611
cites work: Algorithmic analysis of programs with well quasi-ordered domains.
cites work: Undecidable verification problems for programs with unreliable channels
cites work: Verifying programs with unreliable channels
cites work: On Communicating Finite-State Machines
cites work: Unreliable channels are easier to verify than perfect channels
cites work: Q4219024
cites work: Q4938633
cites work: Well-structured transition systems everywhere!
cites work: The equality problem for vector addition systems is undecidable
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Nonprimitive recursive complexity and undecidability for Petri net equivalences
cites work: Q4508393
cites work: The Complexity of the Finite Containment Problem for Petri Nets
cites work: Q5714450
full work available at URL: s0020-0190(01)00337-4
OpenAlex ID: W1987814265
description: scientific article; zbMATH DE number 1856417