Unreliable channels are easier to verify than perfect channels (Q1908353)
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: Publication:1908353 |
scientific article; zbMATH DE number 847834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unreliable channels are easier to verify than perfect channels |
scientific article; zbMATH DE number 847834 |
Statements
Unreliable channels are easier to verify than perfect channels (English)
0 references
27 March 1996
0 references
reachability
0 references
model-checking against CTL\(^*\)
0 references
unboundedness
0 references
deadlock
0 references
0.8564122915267944
0 references
0.8402000665664673
0 references
0.8244999647140503
0 references
0.775244414806366
0 references
