Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems

Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel systems is whether bisimulation is decidable. We show that bisimulation, simulation, and in fact all relations between bisimulation and trace inclusion are undecidable for lossy channel systems (and for lossy vector addition systems).

• Type: Conference
• Year: 2001
• Where: TACS
• Authors: Ph. Schnoebelen
• Keywords: Bisimulation, Lossy Channel Systems, Lossy Vector Addition, Software Engineering, TACS 2001