Undecidable verification problems for programs with unreliable channels
From MaRDI portal
Publication:675223
DOI10.1006/inco.1996.0083zbMath0872.68112OpenAlexW2017872109WikidataQ62638448 ScholiaQ62638448MaRDI QIDQ675223
Bengt Jonsson, Parosh Aziz Abdulla
Publication date: 6 March 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1996.0083
Related Items
Reachability problems on reliable and lossy queue automata, Forward analysis and model checking for trace bounded WSTS, Undecidable problems in unreliable computations., On termination and invariance for faulty channel machines, Decidability of liveness for concurrent objects on the TSO memory model, Value-passing CCS with noisy channels, Deciding properties of integral relational automata, Forward Analysis and Model Checking for Trace Bounded WSTS, Computable fixpoints in well-structured symbolic model checking, A classification of the expressive power of well-structured transition systems, Ensuring completeness of symbolic verification methods for infinite-state systems, Quantitative analysis of probabilistic lossy channel systems, Simulating perfect channels with probabilistic lossy channels, Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness, The ω-Regular Post Embedding Problem, Unnamed Item, \(\pi\)-calculus with noisy channels, Verification of probabilistic systems with faulty communication, Verification of programs with half-duplex communication, Verifying lossy channel systems has nonprimitive recursive complexity., Model checking of systems with many identical timed processes, Algorithmic analysis of programs with well quasi-ordered domains., Undecidable verification problems for programs with unreliable channels
