Pages that link to "Item:Q1819939"
From MaRDI portal
The following pages link to Boundedness, empty channel detection, and synchronization for communicating finite automata (Q1819939):
Displaying 6 items.
- Testing for unboundedness of fifo channels (Q685434) (← links)
- The complexity of reachability in distributed communicating processes (Q1098622) (← links)
- A methodology for constructing communication protocols with multiple concurrent functions (Q1112596) (← links)
- Reduction and covering of infinite reachability trees (Q1173681) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- Communicating processes, scheduling, and the complexity of nontermination (Q3034829) (← links)
