Search Results for author:
Found 4 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.
On the k-synchronizability of systems
In this paper, we work on the notion of k-synchronizability: a system is k-synchronizable if any of its executions, up to reordering causally independent actions, can be divided into a succession of k-bounded interaction phases.
Activity Networks with Delays An application to toxicity analysis
A small case study on blood glucose regulation is provided to exemplify the ANDy framework and the toxicity properties.
