Complexity analysis of propositional concurrent programs using domino tiling

DOI10.1007/BF01189855zbMath0796.68091OpenAlexW3160961226MaRDI QIDQ3142002

Namhee Pak, Hsu-Chun Yen

Publication date: 6 December 1993

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01189855

zbMATH Keywords

CSPconcurrencytiling problemscomplexity classesrendevouz

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Communication in concurrent dynamic logic
• On the analysis of cooperation and antagonism in networks of communicating processes
• A near-optimal method for reasoning about action
• The complexity of problems in systems of communicating sequential processes
• A multiparameter analysis of domino tiling with an application to concurrent systems
• Propositional dynamic logic of regular programs
• Domino-tiling games
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Domino Games and Complexity
• A general-purpose algorithm for analyzing concurrent programs
• Concurrent dynamic logic
• The undecidability of the domino problem

This page was built for publication: Complexity analysis of propositional concurrent programs using domino tiling