{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:03:55Z","timestamp":1649073835746},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1007\/bf01189855","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T21:46:49Z","timestamp":1108676809000},"page":"357-378","source":"Crossref","is-referenced-by-count":0,"title":["Complexity analysis of propositional concurrent programs using domino tiling"],"prefix":"10.1007","volume":"26","author":[{"given":"Hsu -Chun","family":"Yen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Namhee","family":"Pak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Berger, R. The undecidability of the domino problem.Mem. Amer. Math. Soc., 66, 1966.","DOI":"10.1090\/memo\/0066"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"Chandra, A., Kozen, D., and Stockmeyer, L. Alternation.J. Assoc. Comput. Mach., 28:114?133, 1981.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0022-0000(86)90036-X","volume":"32","author":"B. Chlebus","year":"1986","unstructured":"Chlebus, B. Domino-tiling games.J. Comput. System Sci., 32:374?392, 1986.","journal-title":"J. Comput. System Sci."},{"key":"CR4","first-page":"479","volume":"8","author":"B. Chlebus","year":"1987","unstructured":"Chlebus, B. Proving NP-completeness using bounded tiling.J. Inform. Process. Cybernet. EIK, 8:479?484, 1987.","journal-title":"J. Inform. Process. Cybernet. EIK"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M. Fischer","year":"1979","unstructured":"Fischer, M., and Ladner, R. Prepositional dynamic logic of regular programs.J. Comput. System Sci., 18:194?211, 1979.","journal-title":"J. Comput. System Sci."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/0219055","volume":"19","author":"E. Gradel","year":"1990","unstructured":"Gradel, E. Domino games and complexity.SIAM J. Comput., 19:787?804, 1990.","journal-title":"SIAM J. Comput."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-94-009-6259-0_10","volume-title":"Handbook of Philosophical Logic","author":"D. Harel","year":"1984","unstructured":"Harel, D. Dynamic logic. InHandbook of Philosophical Logic (D. Gabbay and F. Guenthner, eds.), Reidel, Dordrecht, pp. 497?604, 1984."},{"key":"CR8","first-page":"51","volume":"24","author":"D. Harel","year":"1985","unstructured":"Harel, D. Recurring dominoes: making the highly undecidable highly understandable.Ann. Discrete Math., 24:51?72, 1985.","journal-title":"Ann. Discrete Math."},{"issue":"l","key":"CR9","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/4904.4993","volume":"33","author":"D. Harel","year":"1986","unstructured":"Harel, D. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness.J. Assoc. Comput. Mach., 33(l):224?248, 1986.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR10","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., and Ullman, J.Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Cambridge, MA, 1979."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF01762125","volume":"3","author":"P. Kanellakis","year":"1988","unstructured":"Kanellakis, P., and Smolka, S. On the analysis of cooperation and antagonism in networks of communicating processes.Algorithmica, 3:421?450, 1988.","journal-title":"Algorithmica"},{"key":"CR12","first-page":"789","volume-title":"Handbook of Theoretical Computer Science","author":"D. Kozen","year":"1990","unstructured":"Kozen, D., and Tiuryn, J. Logics of programs. InHandbook of Theoretical Computer Science (J. van Leeuwen, ed.), Vol. B, Eisevier, Amsterdam, pp. 789?840, 1990."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(80)90033-1","volume":"21","author":"R. Ladner","year":"1980","unstructured":"Ladner, R. The complexity of problems in systems of communicating sequential processes.J. Comput. System Sci., 21:179?194, 1980.","journal-title":"J. Comput. System Sci."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Lewis, H. Complexity of solvable cases of the decision problem for the predicate calculus.Proc. 19th Ann. IEEE Symp. on Foundations of Computer Science, pp. 35?47, 1978.","DOI":"10.1109\/SFCS.1978.9"},{"key":"CR15","volume-title":"Elements of the Theory of Computation","author":"H. Lewis","year":"1981","unstructured":"Lewis, H., and Papadimitriou, C.Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs, NJ, 1981."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1145\/23005.23008","volume":"34","author":"D. Peleg","year":"1987","unstructured":"Peleg, D. Concurrent dynamic logic.J Assoc. Comput. Mach., 34:450?479, 1987.","journal-title":"J Assoc. Comput. Mach."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(87)90035-3","volume":"35","author":"D. Peleg","year":"1987","unstructured":"Peleg, D. Communication in concurrent dynamic logic.J. Comput. SystemSci., 35:23?58, 1987.","journal-title":"J. Comput. SystemSci."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Pratt, V. Models of program logics.Proc. 20th Ann. IEEE Symp. on Foundations of Computer Science, pp. 115?122, 1979.","DOI":"10.1109\/SFCS.1979.24"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0022-0000(80)90061-6","volume":"20","author":"V. Pratt","year":"1980","unstructured":"Pratt, V. A near-optimal method for reasoning about actions.J. Comput. System Sci., 20:231?254, 1980.","journal-title":"J. Comput. System Sci."},{"key":"CR20","unstructured":"Savlsberg, M., and van Emde Boas, P. Bounded tiling, an alternative to satisfiability?Proc. 2nd Frege Conference, Schwerin 1984, Mathematische Forschung, pp. 354?363, 1984."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF00263928","volume":"19","author":"R. Taylor","year":"1983","unstructured":"Taylor, R. Complexity of analyzing the synchronization structure of concurrent programs.Acta Inform., 19:57?84, 1983.","journal-title":"Acta Inform."},{"issue":"5","key":"CR22","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/69586.69587","volume":"26","author":"R. Taylor","year":"1983","unstructured":"Taylor, R. A general-purpose algorithm for analyzing concurrent programs.Comm. ACM, 26(5): 362?376, 1983.","journal-title":"Comm. ACM"},{"key":"CR23","unstructured":"van Emde Boas, P. Dominoes are forever.Proc. 1st GTI Workshop (Paderborn), pp. 76?95, 1983."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H. Wang","year":"1961","unstructured":"Wang, H. Proving theorems by pattern recognition, ii.Bell System Tech. J., 40:1?4, 1961.","journal-title":"Bell System Tech. J."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(92)90004-Y","volume":"98","author":"H. Yen","year":"1992","unstructured":"Yen, H. A multiparameter analysis of domino tiling with an application to concurrent systems.Theoret. Comput. Sci., 98:263?287, 1992.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189855.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01189855\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:08:04Z","timestamp":1556629684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01189855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["BF01189855"],"URL":"https:\/\/doi.org\/10.1007\/bf01189855","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}