Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078)
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: Verifying lossy channel systems has nonprimitive recursive complexity. |
scientific article; zbMATH DE number 1856417
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Verifying lossy channel systems has nonprimitive recursive complexity. |
scientific article; zbMATH DE number 1856417 |
Statements
Verifying lossy channel systems has nonprimitive recursive complexity. (English)
0 references
21 January 2003
0 references
Verification of infinite-state systems
0 references
Communication protocols
0 references
Program correctness
0 references
Formal methods
0 references
