Sciweavers

374 search results - page 2 / 75
» On Communicating Automata with Bounded Channels
Sort
View
TACS
2001
Springer
13 years 9 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 sy...
Ph. Schnoebelen
FOSSACS
2003
Springer
13 years 10 months ago
Model Checking Lossy Channels Systems Is Probably Decidable
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
Nathalie Bertrand, Ph. Schnoebelen
CORR
2010
Springer
114views Education» more  CORR 2010»
12 years 11 months ago
Secure Communication over Parallel Relay Channel
We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel wh...
Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendo...
ESOP
2012
Springer
12 years 15 days ago
Multiparty Session Types Meet Communicating Automata
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
Pierre-Malo Deniélou, Nobuko Yoshida
SPIN
2000
Springer
13 years 8 months ago
Communication Topology Analysis for Concurrent Programs
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
Matthieu Martel, Marc Gengler