Priority Networks of Communicating Finite State Machines

DOI10.1137/0214042MaRDI QIDQ3677157zbMATH OpenOpenAlexFDO

Authors 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

bounded communicationcommunicating finite state machinescommunication progresscommunication protocolsdeadlock detectiondeadlock-freemessage passingpriority channelspriority systems

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 3881887
• Analysis of a class of communicating finite state machines
• scientific article; zbMATH DE number 4043216
• On the decidability of correctness problems for a communicating automata net
• On the progress of communication between two finite state machines

Cited in

(13)

• The complexity of reachability in distributed communicating processes
• Analysis of a class of communicating finite state machines
• A multiparameter analysis of the boundedness problem for vector addition systems
• Boundedness, empty channel detection, and synchronization for communicating finite automata
• Communicating processes, scheduling, and the complexity of nontermination
• scientific article; zbMATH DE number 3881887 (Why is no real title available?)
• scientific article; zbMATH DE number 3907779 (Why is no real title available?)
• Protocol validation by fair progress state exploration
• Proving liveness for networks of communicating finite state machines
• Boundedness, hierarchy of fairness, and communication networks with delay
• The power of priority channel systems
• Well-structured transition systems everywhere!
• Priority systems with many identical processes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677157)