scientific article
From MaRDI portal
Publication:3780411
zbMath0639.68009MaRDI QIDQ3780411
Eitan M. Gurari, Louis E. Rosier, Mohamed G. Gouda, Ten-Hwang Lai
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The complexity of reachability in distributed communicating processes, Well-abstracted transition systems: Application to FIFO automata., Unnamed Item, Reduction and covering of infinite reachability trees, Testing for unboundedness of fifo channels, Communicating processes, scheduling, and the complexity of nontermination, Non axiomatisability of positive relation algebras with constants, via graph homomorphisms, A multiparameter analysis of the boundedness problem for vector addition systems, Undecidable verification problems for programs with unreliable channels, Analysis of a class of communicating finite state machines
