Unboundedness detection for a class of communicating finite-state machines

DOI10.1016/0020-0190(83)90105-9zbMath0519.68067OpenAlexW1990154918MaRDI QIDQ1054479

Yao-Tin Yu, Mohamed G. Gouda

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

zbMATH Keywords

algorithmdeadlock detectioncommunication protocolscommunicating finite-state machinesreachability treeunboundedness detection

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

The complexity of reachability in distributed communicating processes ⋮ Unnamed Item ⋮ Non axiomatisability of positive relation algebras with constants, via graph homomorphisms ⋮ 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 ⋮ Analysis of a class of communicating finite state machines

Cites Work

• Deadlock Detection for a Class of Communicating Finite State Machines

This page was built for publication: Unboundedness detection for a class of communicating finite-state machines