Unboundedness detection for a class of communicating finite-state machines
From MaRDI portal
Publication:1054479
DOI10.1016/0020-0190(83)90105-9zbMath0519.68067MaRDI QIDQ1054479
Publication date: 1983
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(83)90105-9
algorithm; deadlock detection; communication protocols; communicating finite-state machines; reachability tree; unboundedness detection
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
Related Items
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, Boundedness, hierarchy of fairness, and communication networks with delay
Cites Work