The following pages link to (Q4037389):
Displaying 4 items.
- Analysis of a class of communicating finite state machines (Q1323365) (← links)
- On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels (Q1974312) (← links)
- Deadlock analysis in networks of communicating processes (Q2638755) (← links)
- On the undecidability of deadlock detection in families of nets (Q4596646) (← links)