Pages that link to "Item:Q5137015"
From MaRDI portal
The following pages link to Synchronous, asynchronous, and causally ordered communication (Q5137015):
Displaying 17 items.
- A limitation of vector timestamps for reconstructing distributed computations (Q293417) (← links)
- On the diversity of asynchronous communication (Q315311) (← links)
- On deciding synchronizability for asynchronously communicating systems (Q344799) (← links)
- A simple characterization of asynchronous computations (Q477089) (← links)
- On the axiomatizability of some first-order spatio-temporal theories (Q514577) (← links)
- Communication patterns in distributed computations (Q701162) (← links)
- A framework for viewing atomic events in distributed computations (Q1128710) (← links)
- The causal ordering abstraction and a simple way to implement it (Q1183422) (← links)
- Verifying programs that use causally-ordered message-passing (Q1893537) (← links)
- A modular framework for verifying versatile distributed systems (Q2011199) (← links)
- Behavioural semantics for asynchronous components (Q2397038) (← links)
- Multiparty half-duplex systems and synchronous communications (Q2683034) (← links)
- Asynchronous message orderings beyond causality (Q3300832) (← links)
- Necessary and sufficient conditions on information for causal message ordering and their optimal implementation (Q5137351) (← links)
- Guessing the Buffer Bound for k-Synchronizability (Q6070755) (← links)
- Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata (Q6547963) (← links)
- Weakly synchronous systems with three machines are Turing powerful (Q6623012) (← links)