On the completeness of verifying message passing programs under bounded asynchrony (Q6043166)
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: On the completeness of verifying message passing programs under bounded asynchrony |
scientific article; zbMATH DE number 7682388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the completeness of verifying message passing programs under bounded asynchrony |
scientific article; zbMATH DE number 7682388 |
Statements
On the completeness of verifying message passing programs under bounded asynchrony (English)
0 references
5 May 2023
0 references
0.7890567183494568
0 references
0.7802908420562744
0 references
0.775105893611908
0 references
0.737964391708374
0 references
