Sciweavers

Share
TACS
2001
Springer

Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems

9 years 11 months ago
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).
Ph. Schnoebelen
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where TACS
Authors Ph. Schnoebelen
Comments (0)
books