Unreliable channels are easier to verify than perfect channels

DOI10.1006/INCO.1996.0003zbMATH Open0844.68035OpenAlexW1985925577MaRDI QIDQ1908353FDOQ1908353

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

Recommendations

• Verifying programs with unreliable channels
• Undecidable verification problems for programs with unreliable channels
• Undecidable verification problems for programs with unreliable channels
• Verification of probabilistic systems with faulty communication
• scientific article; zbMATH DE number 1956504

zbMATH Keywords

reachabilityunboundednessdeadlockmodel-checking against CTL\(^*\)

Mathematics Subject Classification ID

Cited In (33)

• A classification of the expressive power of well-structured transition systems
• Zeno, Hercules, and the Hydra
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• A Sound Algorithm for Asynchronous Session Subtyping
• Title not available (Why is that?)
• Verifying identical communicating processes is undecidable
• Generalized Post embedding problems
• Automated formal analysis and verification: an overview
• Well-structured transition systems everywhere!
• Modeling robust asynchronous communication protocols with finite-state machines
• Undecidable problems in unreliable computations.
• Multiparty half-duplex systems and synchronous communications
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Title not available (Why is that?)
• Distributed Computing – IWDC 2005
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• Verification of programs with half-duplex communication
• Quantitative analysis of probabilistic lossy channel systems
• Towards generalised half-duplex systems
• On the termination and structural termination problems for counter machines with incrementing errors
• The transformation monoid of a partially lossy queue
• Verification of probabilistic systems with faulty communication
• Computable fixpoints in well-structured symbolic model checking
• The inclusion structure of partially lossy queue monoids and their trace submonoids
• Handling infinitely branching well-structured transition systems
• Title not available (Why is that?)
• Complexity hierarchies beyond elementary
• Rational, recognizable, and aperiodic partially lossy queue languages
• On termination and invariance for faulty channel machines
• Title not available (Why is that?)
• A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
• Mixing Lossy and Perfect Fifo Channels
• Ordinal recursive complexity of unordered data nets

This page was built for publication: Unreliable channels are easier to verify than perfect channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908353)