Pages that link to "Item:Q1908353"
From MaRDI portal
The following pages link to Unreliable channels are easier to verify than perfect channels (Q1908353):
Displaying 8 items.
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- A classification of the expressive power of well-structured transition systems (Q553290) (← links)
- Verifying identical communicating processes is undecidable (Q1269916) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- (Q5090942) (← links)
- A Sound Algorithm for Asynchronous Session Subtyping (Q5875400) (← links)
