The complexities of the possible rendezvous and the lockout problems for propositional concurrent progmms will be investigated an detail. W e develop a unified strategy, based on domino tiling, to show that the above two problems with respect to a variety of propositional concurrent progmms are complete for a broad spectrum of complexity classes, ranging from NLOGSPACE, PTIME, NP, PSPACE to EXPTIME. Our 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.
The complexities of the possible rendezvous and the lockout problems for propositional concurrent progmms will be investigated an detail. W e develop a unified strategy, based on domino tiling, to show that the above two problems with respect to a variety of propositional concurrent progmms are complete for a broad spectrum of complexity classes, ranging from NLOGSPACE, PTIME, NP, PSPACE to EXPTIME. Our 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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.