Pages that link to "Item:Q675223"
From MaRDI portal
The following pages link to Undecidable verification problems for programs with unreliable channels (Q675223):
Displaying 22 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Value-passing CCS with noisy channels (Q428864) (← links)
- A classification of the expressive power of well-structured transition systems (Q553290) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Simulating perfect channels with probabilistic lossy channels (Q1776399) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Quantitative analysis of probabilistic lossy channel systems (Q2495651) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- Verification of probabilistic systems with faulty communication (Q2573634) (← links)
- Verification of programs with half-duplex communication (Q2573635) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness (Q3613069) (← links)
- Deciding properties of integral relational automata (Q4632414) (← links)
- Undecidable verification problems for programs with unreliable channels (Q4632436) (← links)
- (Q5136306) (← links)
- The ω-Regular Post Embedding Problem (Q5458353) (← links)
- Ensuring completeness of symbolic verification methods for infinite-state systems (Q5941104) (← links)
