Priority Networks of Communicating Finite State Machines

DOI10.1137/0214042zbMath0563.68021OpenAlexW2004146071MaRDI QIDQ3677157

Louis E. Rosier, Mohamed G. Gouda

Publication date: 1985

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0214042

zbMATH Keywords

message passingdeadlock detectioncommunication protocolspriority systemscommunication progressdeadlock-freecommunicating finite state machinesbounded communicationpriority channels

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (7)

The complexity of reachability in distributed communicating processes ⋮ Communicating processes, scheduling, and the complexity of nontermination ⋮ Well-structured transition systems everywhere! ⋮ Priority systems with many identical processes ⋮ A multiparameter analysis of the boundedness problem for vector addition systems ⋮ Boundedness, empty channel detection, and synchronization for communicating finite automata ⋮ Boundedness, hierarchy of fairness, and communication networks with delay

This page was built for publication: Priority Networks of Communicating Finite State Machines