The synthesis of communication protocols (Q1098296)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The synthesis of communication protocols |
scientific article; zbMATH DE number 4037205
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The synthesis of communication protocols |
scientific article; zbMATH DE number 4037205 |
Statements
The synthesis of communication protocols (English)
0 references
1988
0 references
We define a notation (specification language) for describing desired patterns of communication among components of a distributed system through multiport, unreliable channels. Our language specifies the network topology, and the kinds of information transmission desired. We give a polynomial-time algorithm for determining whether a specification is satifiable; our algorithm can actually construct a protocol that achieves the specified exchange of information, optimized with respect to two possible criteria. Examples suggest that our method can automatically synthesize reasonably complex protocols.
0 references
communicating
0 references
finite automata
0 references
communication protocols
0 references
synthesis algorithm
0 references
knowledge logic
0 references
PSPACE-complete
0 references
distributed system
0 references
polynomial-time algorithm
0 references
0.7929028868675232
0 references
0.7852993011474609
0 references
0.7669335007667542
0 references
0.7563900947570801
0 references
