Complexity analysis of propositional concurrent programs using domino tiling

The complexities of the possible rendezvous and the lockout problems for propositional concurrent programs are investigated in detail. The authors develop a unified strategy, based on domino tiling, to show that the two problems with respect to a variety of propositional concurrent programs are complete for a broad spectrum of complexity classes, ranging from NLOGSPACE, PTIME, NP, and PSPACE to EXPTIME. The technique is novel in the sense that it demonstrates how two seemingly unrelated models, namely propositional concurrent programs and dominoes, can be linked together in a natural and elegant fashion.<
>