Mixing Lossy and Perfect Fifo Channels

DOI10.1007/978-3-540-85361-9_28MaRDI QIDQ3541029zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Recommendations

• Decidable topologies for communicating automata with FIFO and bag channels
• Verifying programs with unreliable channels
• Undecidable verification problems for programs with unreliable channels
• Data communicating processes with unreliable channels
• Undecidable verification problems for programs with unreliable channels

Cites work

• A theory of regular MSC languages
• Alternating timed automata
• Bounded MSC communication
• Mixing Lossy and Perfect Fifo Channels
• On Communicating Finite-State Machines
• On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
• On termination for faulty channel machines
• On the decidability and complexity of Metric Temporal Logic over finite words
• Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
• Simulating perfect channels with probabilistic lossy channels
• The ω-Regular Post Embedding Problem
• Unreliable channels are easier to verify than perfect channels
• Using forward reachability analysis for verification of lossy channel systems
• Validation of Stochastic Systems
• Verification of probabilistic systems with faulty communication
• Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
• Verifying programs with unreliable channels

Cited in

(13)

• Mixing Lossy and Perfect Fifo Channels
• Decidable topologies for communicating automata with FIFO and bag channels
• Event-B-supported choreography-defined communicating systems
• On functions weakly computable by pushdown Petri nets and related systems
• Forward analysis and model checking for trace bounded WSTS
• Tutorial on parameterized model checking of fault-tolerant distributed algorithms
• Simulating perfect channels with probabilistic lossy channels
• Multi-buffer simulations for trace language inclusion
• Multiparty half-duplex systems and synchronous communications
• Computable fixpoints in well-structured symbolic model checking
• On termination and invariance for faulty channel machines
• On freeze LTL with ordered attributes
• Ordinal recursive complexity of unordered data nets

This page was built for publication: Mixing Lossy and Perfect Fifo Channels

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