Search Results for author:
Found 2 papers, 0 papers with code
Weakly synchronous systems with three machines are Turing powerful
In particular, we explore the intriguing case of p2p (FIFO) communication, for which the reachability problem is known to be undecidable for four processes, but decidable for two.
A partial order view of message-passing communication models
There is a wide variety of message-passing communication models, ranging from synchronous ''rendez-vous'' communications to fully asynchronous/out-of-order communications.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
