Pages that link to "Item:Q1819939"

The following pages link to Boundedness, empty channel detection, and synchronization for communicating finite automata (Q1819939):

Displaying 15 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)
• Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)
• Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
• On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels (Q1974312) (← links)
• Connecting open systems of communicating finite state machines (Q2011202) (← links)
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
• Multiparty half-duplex systems and synchronous communications (Q2683034) (← links)
• A characterization of definable communicating systems (Q2720916) (← links)
• Communicating processes, scheduling, and the complexity of nontermination (Q3034829) (← links)
• Boundedness, hierarchy of fairness, and communication networks with delay (Q4207557) (← links)
• Undecidable verification problems for programs with unreliable channels (Q4632436) (← links)
• Synchronizability of communicating finite state machines is not decidable (Q5111454) (← links)