Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Probabilistic verification of communication protocols

From MaRDI portal
Publication:916356
Jump to:navigation, search

DOI10.1007/BF01784022zbMath0703.68023OpenAlexW1546325561MaRDI QIDQ916356

Krishan Sabnani, Nicholas F. Maxemchuk

Publication date: 1989

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01784022

zbMATH Keywords

probabilistic analysisvalidationprotocolsprobabilistic verification


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)


Related Items

ECFSM-based probabilistic protocol verification



Cites Work

  • Verification of multiprocess probabilistic protocols
  • Verification of a multidestination selective repeat procedure
  • Closed Covers: To Verify Progress for Communicating Finite State Machines
  • Protocol Verification via Projections
  • An algorithmic technique for protocol verification
  • Communicating sequential processes
  • Fast Sequential Decoding Algorithm Using a Stack
  • Testing and generating infinite sequences by a finite automaton
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:916356&oldid=12883624"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki