Probabilistic verification of communication protocols
type: Item
instance of: scholarly article
title: Probabilistic verification of communication protocols
zbMATH Open document ID: 0703.68023
DOI: 10.1007/BF01784022
author: Krishan Sabnani
author: Nicholas F. Maxemchuk
published in: Distributed Computing
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 4153866
zbMATH Keywords: probabilistic analysis
zbMATH Keywords: validation
zbMATH Keywords: probabilistic verification
zbMATH Keywords: protocols
MaRDI profile type: Publication
cites work: Closed Covers: To Verify Progress for Communicating Finite State Machines
cites work: Communicating sequential processes
cites work: Fast Sequential Decoding Algorithm Using a Stack
cites work: Protocol Verification via Projections
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Verification of multiprocess probabilistic protocols
cites work: An algorithmic technique for protocol verification
cites work: Verification of a multidestination selective repeat procedure
full work available at URL: https://doi.org/10.1007/bf01784022
OpenAlex ID: W1546325561
description: scientific article; zbMATH DE number 4153866