Complexity analysis of propositional concurrent programs using domino tiling

DOI10.1007/BF01189855MaRDI QIDQ3142002zbMATH OpenOpenAlexFDO

Authors Hsu-Chun Yen, Namhee Pak

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

complexity classesCSPconcurrencytiling problemsrendevouz

Mathematics Subject Classification ID

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

Recommendations

• A multiparameter analysis of domino tiling with an application to concurrent systems
• Domino-tiling games
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• scientific article; zbMATH DE number 1048047
• On the solvability of domino snake problems

Cites work

• scientific article; zbMATH DE number 4039295 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3727583 (Why is no real title available?)
• scientific article; zbMATH DE number 1032009 (Why is no real title available?)
• scientific article; zbMATH DE number 1142324 (Why is no real title available?)
• scientific article; zbMATH DE number 3894472 (Why is no real title available?)
• A general-purpose algorithm for analyzing concurrent programs
• A multiparameter analysis of domino tiling with an application to concurrent systems
• A near-optimal method for reasoning about action
• Communication in concurrent dynamic logic
• Concurrent dynamic logic
• Domino Games and Complexity
• Domino-tiling games
• On the analysis of cooperation and antagonism in networks of communicating processes
• Propositional dynamic logic of regular programs
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• The complexity of problems in systems of communicating sequential processes
• The undecidability of the domino problem

Cited in

(1)

• A multiparameter analysis of domino tiling with an application to concurrent systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142002)