Complexity analysis of propositional concurrent programs using domino tiling
From MaRDI portal
Publication:3142002
DOI10.1007/BF01189855zbMATH Open0796.68091OpenAlexW3160961226MaRDI QIDQ3142002FDOQ3142002
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Propositional dynamic logic of regular programs
- Title not available (Why is that?)
- Communication in concurrent dynamic logic
- Concurrent dynamic logic
- The undecidability of the domino problem
- A near-optimal method for reasoning about action
- Domino-tiling games
- Recurring Dominoes: Making the Highly Undecidable Highly Understandable
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the analysis of cooperation and antagonism in networks of communicating processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of problems in systems of communicating sequential processes
- Domino Games and Complexity
- A multiparameter analysis of domino tiling with an application to concurrent systems
- A general-purpose algorithm for analyzing concurrent programs
Cited In (1)
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)
