{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:11:09Z","timestamp":1743138669859,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319624334"},{"type":"electronic","value":"9783319624341"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62434-1_28","type":"book-chapter","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T23:54:19Z","timestamp":1501631659000},"page":"332-345","source":"Crossref","is-referenced-by-count":1,"title":["On Verification of Workflow and Planning Domain Models Using Attribute Grammars"],"prefix":"10.1007","author":[{"given":"Roman","family":"Bart\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Dvo\u0159\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,3]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-662-49192-8_14","volume-title":"SOFSEM 2016: Theory and Practice of Computer Science","author":"R Bart\u00e1k","year":"2016","unstructured":"Bart\u00e1k, R.: Using attribute grammars to model nested workflows with extra constraints. In: Freivalds, R.M., Engels, G., Catania, B. (eds.) SOFSEM 2016. LNCS, vol. 9587, pp. 171\u2013182. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49192-8_14"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Bart\u00e1k, R., Cully, M., Ja\u0161ka, M., Nov\u00e1k, L., Rovensk\u00fd, V., Sheahan, C., Skalick\u00fd, T., Thanh-Tung, D.: Workflow optimization with flowopt, on modelling, optimizing, visualizing, and analysing production workflows. In: Proceedings of Conference on Technologies and Applications of Artificial Intelligence (TAAI 2011), pp. 167\u2013172. IEEE Conference Publishing Services (2011)","DOI":"10.1109\/TAAI.2011.36"},{"issue":"3","key":"28_CR3","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1016\/j.eswa.2013.08.021","volume":"41","author":"R Bart\u00e1k","year":"2014","unstructured":"Bart\u00e1k, R., Rovensk\u00fd, V.: On verification of nested workflows with extra constraints: from theory to practice. Expert Syst. Appl. 41(3), 904\u2013918 (2014). Elsevier","journal-title":"Expert Syst. Appl."},{"issue":"3\u20134","key":"28_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/B:ITEM.0000031583.16306.0f","volume":"5","author":"HH Bi","year":"2004","unstructured":"Bi, H.H., Zhao, J.L.: Applying propositional logic to workflow verification. Inf. Technol. Manag. 5(3\u20134), 293\u2013318 (2004)","journal-title":"Inf. Technol. Manag."},{"key":"28_CR5","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"28_CR6","unstructured":"Dvo\u0159\u00e1k, T.: Hierarchick\u00e9 modelov\u00e1n\u00ed pl\u00e1novac\u00edch probl\u00e9m\u016f. Master Thesis (in Czech), Charles University (2016)"},{"issue":"2","key":"28_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"DE Knuth","year":"1968","unstructured":"Knuth, D.E.: Semantics of context-free languages. Math. Syst. Theor. 2(2), 127\u2013145 (1968)","journal-title":"Math. Syst. Theor."},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1613\/jair.1141","volume":"20","author":"DS Nau","year":"2003","unstructured":"Nau, D.S., Au, T.-C., Ilghami, O., Kuter, U., Murdock, J.W., Wu, D., Yaman, F.: SHOP2: an HTN planning system. J. Artif. Intell. Res. (JAIR) 20, 379\u2013404 (2003)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"2","key":"28_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0306-4379(00)00012-0","volume":"25","author":"W Sadiq","year":"2000","unstructured":"Sadiq, W., Orlowska, M.E.: Analyzing process models using graph reduction techniques. Inf. Syst. 25(2), 117\u2013134 (2000)","journal-title":"Inf. Syst."},{"issue":"1","key":"28_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0306-4379(00)00008-9","volume":"25","author":"W Aalst van der","year":"2000","unstructured":"van der Aalst, W., ter Hofstede, A.H.M.: Verification of workflow task structures: a petri-net-based approach. Inf. Syst. 25(1), 43\u201369 (2000)","journal-title":"Inf. Syst."},{"issue":"1","key":"28_CR11","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/S0019-9958(70)80007-9","volume":"17","author":"K Taniguchi","year":"1970","unstructured":"Taniguchi, K., Kasami, T.: Reduction of context-free grammars. Inf. Control 17(1), 92\u2013108 (1970)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62434-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T19:04:04Z","timestamp":1569956644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62434-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319624334","9783319624341"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62434-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}