Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00337-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987814265 / rank | |||
Normal rank |
Latest revision as of 10:31, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Verifying lossy channel systems has nonprimitive recursive complexity. |
scientific article |
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