The complexity of reachability in distributed communicating processes

This publication has 18 references indexed in Scilit:

• Priority Networks of Communicating Finite State Machines
  SIAM Journal on Computing, 1985
• On Communicating Finite-State Machines
  Journal of the ACM, 1983
• The complexity of the word problems for commutative semigroups and polynomial ideals
  Advances in Mathematics, 1982
• The complexity of problems in systems of communicating sequential processes
  Journal of Computer and System Sciences, 1980
• A Calculus of Communicating Systems
  Lecture Notes in Computer Science, 1980
• High level programming for distributed computing
  Communications of the ACM, 1979
• Communicating sequential processes
  Communications of the ACM, 1978
• The covering and boundedness problems for vector addition systems
  Theoretical Computer Science, 1978
• Path Expressions
  Published by Defense Technical Information Center (DTIC) ,1975
• Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
  Annals of Mathematics, 1961