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 21 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)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q1960526) (← links)
- On the termination and structural termination problems for counter machines with incrementing errors (Q2037198) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Generalized Post embedding problems (Q2354596) (← links)
- The transformation monoid of a partially lossy queue (Q2399374) (← links)
- Quantitative analysis of probabilistic lossy channel systems (Q2495651) (← links)
- Verification of probabilistic systems with faulty communication (Q2573634) (← links)
- Verification of programs with half-duplex communication (Q2573635) (← links)
- Multiparty half-duplex systems and synchronous communications (Q2683034) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- (Q3304144) (← links)
- (Q5090942) (← links)
- A Sound Algorithm for Asynchronous Session Subtyping (Q5875400) (← links)
