Pages that link to "Item:Q1054479"

The following pages link to Unboundedness detection for a class of communicating finite-state machines (Q1054479):

Displaying 7 items.

• The complexity of reachability in distributed communicating processes (Q1098622) (← links)
• Analysis of a class of communicating finite state machines (Q1323365) (← links)
• A multiparameter analysis of the boundedness problem for vector addition systems (Q1819938) (← links)
• Boundedness, empty channel detection, and synchronization for communicating finite automata (Q1819939) (← links)
• Boundedness, hierarchy of fairness, and communication networks with delay (Q4207557) (← links)
• (Q5028474) (← links)
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)