Mixing Lossy and Perfect Fifo Channels
From MaRDI portal
Publication:3541029
DOI10.1007/978-3-540-85361-9_28zbMath1160.68460OpenAlexW1511439447MaRDI QIDQ3541029
Pierre Chambart, Philippe Schnoebelen
Publication date: 25 November 2008
Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_28
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)
Related Items (13)
Event-B-Supported Choreography-Defined Communicating Systems ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ Unnamed Item ⋮ Multiparty half-duplex systems and synchronous communications ⋮ On termination and invariance for faulty channel machines ⋮ Unnamed Item ⋮ Mixing Lossy and Perfect Fifo Channels ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Ordinal recursive complexity of unordered data nets ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Unnamed Item ⋮ On Freeze LTL with Ordered Attributes ⋮ Generalized Post embedding problems
Cites Work
- Simulating perfect channels with probabilistic lossy channels
- Using forward reachability analysis for verification of lossy channel systems
- Bounded MSC communication
- Unreliable channels are easier to verify than perfect channels
- Verifying programs with unreliable channels
- A theory of regular MSC languages
- Verification of probabilistic systems with faulty communication
- Mixing Lossy and Perfect Fifo Channels
- On Communicating Finite-State Machines
- On Termination for Faulty Channel Machines
- Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
- Alternating timed automata
- On the decidability and complexity of Metric Temporal Logic over finite words
- Validation of Stochastic Systems
- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
- The ω-Regular Post Embedding Problem
- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
This page was built for publication: Mixing Lossy and Perfect Fifo Channels