Complexity analysis of propositional concurrent programs using domino tiling | Zendy

Hsu -Chun Yen | Zendy; Namhee Pak | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Complexity analysis of propositional concurrent programs using domino tiling

Author(s) -

Hsu -Chun Yen,

Namhee Pak

Publication year - 1993

Publication title -

mathematical systems theory

Language(s) - English

Resource type - Journals

ISSN - 0025-5661

DOI - 10.1007/bf01189855

Subject(s) - domino , exptime , rendezvous , computer science , variety (cybernetics) , propositional calculus , pspace , theoretical computer science , discrete mathematics , mathematics , computational complexity theory , programming language , algorithm , artificial intelligence , biochemistry , chemistry , engineering , spacecraft , aerospace engineering , catalysis

The complexities of the possible rendezvous and the lockout problems for propositional concurrent programs are investigated in detail. We develop a unified strategy, based on domino tiling, to show that the above 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, 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 content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research