Unreliable channels are easier to verify than perfect channels
From MaRDI portal
Publication:1908353
DOI10.1006/inco.1996.0003zbMath0844.68035MaRDI QIDQ1908353
Alain Finkel, S. Purushothaman Iyer, Gérard Cécé
Publication date: 27 March 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ca36046e1bfcedc91db31991e877875e4f48e668
Related Items
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations, The inclusion structure of partially lossy queue monoids and their trace submonoids, Zeno, Hercules, and the Hydra, Well-structured transition systems everywhere!, Ordinal recursive complexity of unordered data nets, A classification of the expressive power of well-structured transition systems, Verifying identical communicating processes is undecidable, Undecidable problems in unreliable computations., Handling infinitely branching well-structured transition systems, Verifying lossy channel systems has nonprimitive recursive complexity., On termination and invariance for faulty channel machines, Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations, Computable fixpoints in well-structured symbolic model checking, Generalized Post embedding problems, The transformation monoid of a partially lossy queue, Quantitative analysis of probabilistic lossy channel systems, Verification of probabilistic systems with faulty communication, Verification of programs with half-duplex communication, Complexity Hierarchies beyond Elementary, Automated formal analysis and verification: an overview, Mixing Lossy and Perfect Fifo Channels, A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
