Unreliable channels are easier to verify than perfect channels
From MaRDI portal
(Redirected from Publication:1908353)
Recommendations
Cited in
(35)- A classification of the expressive power of well-structured transition systems
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
- Mixing Lossy and Perfect Fifo Channels
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Non-deterministic transducer models of retransmission protocols over noisy channels
- Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
- A Sound Algorithm for Asynchronous Session Subtyping
- Verifying identical communicating processes is undecidable
- scientific article; zbMATH DE number 1863156 (Why is no real title available?)
- Automated formal analysis and verification: an overview
- Well-structured transition systems everywhere!
- Zeno, Hercules, and the Hydra: safety metric temporal logic is Ackermann-complete
- Undecidable problems in unreliable computations.
- Modeling robust asynchronous communication protocols with finite-state machines
- Multiparty half-duplex systems and synchronous communications
- Verifying lossy channel systems has nonprimitive recursive complexity.
- scientific article; zbMATH DE number 7561314 (Why is no real title available?)
- On termination for faulty channel machines
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Distributed Computing – IWDC 2005
- Verification of programs with half-duplex communication
- Quantitative analysis of probabilistic lossy channel systems
- On the termination and structural termination problems for counter machines with incrementing errors
- Towards generalised half-duplex systems
- The transformation monoid of a partially lossy queue
- Verification of probabilistic systems with faulty communication
- Computable fixpoints in well-structured symbolic model checking
- Handling infinitely branching well-structured transition systems
- The inclusion structure of partially lossy queue monoids and their trace submonoids
- A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
- Complexity hierarchies beyond elementary
- Rational, recognizable, and aperiodic partially lossy queue languages
- On termination and invariance for faulty channel machines
- scientific article; zbMATH DE number 7327953 (Why is no real title available?)
- 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)
