Abstract
Recently, attribute grammars have been suggested as a unifying framework to describe workflow and planning domains models. One of the critical aspects of the domain model is its soundness, that is, the model should not contain any dead-ends and should describe at least one plan. In this paper we describe how the domain model can be verified by using the concept of reduction of attribute grammars. Two verification methods are suggested, one based on transformation to context-free grammars and one direct method exploiting constraint satisfaction.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Barták, 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–182. Springer, Heidelberg (2016). doi:10.1007/978-3-662-49192-8_14
Barták, R., Cully, M., Jaška, M., Novák, L., Rovenský, V., Sheahan, C., Skalický, 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–172. IEEE Conference Publishing Services (2011)
Barták, R., Rovenský, V.: On verification of nested workflows with extra constraints: from theory to practice. Expert Syst. Appl. 41(3), 904–918 (2014). Elsevier
Bi, H.H., Zhao, J.L.: Applying propositional logic to workflow verification. Inf. Technol. Manag. 5(3–4), 293–318 (2004)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Dvořák, T.: Hierarchické modelování plánovacích problémů. Master Thesis (in Czech), Charles University (2016)
Knuth, D.E.: Semantics of context-free languages. Math. Syst. Theor. 2(2), 127–145 (1968)
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–404 (2003)
Sadiq, W., Orlowska, M.E.: Analyzing process models using graph reduction techniques. Inf. Syst. 25(2), 117–134 (2000)
van der Aalst, W., ter Hofstede, A.H.M.: Verification of workflow task structures: a petri-net-based approach. Inf. Syst. 25(1), 43–69 (2000)
Taniguchi, K., Kasami, T.: Reduction of context-free grammars. Inf. Control 17(1), 92–108 (1970)
Acknowledgements
Research is supported by the Czech Science Foundation under the project P103-15-19877S.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Barták, R., Dvořák, T. (2017). On Verification of Workflow and Planning Domain Models Using Attribute Grammars. In: Sidorov, G., Herrera-Alcántara, O. (eds) Advances in Computational Intelligence. MICAI 2016. Lecture Notes in Computer Science(), vol 10061. Springer, Cham. https://doi.org/10.1007/978-3-319-62434-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-62434-1_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62433-4
Online ISBN: 978-3-319-62434-1
eBook Packages: Computer ScienceComputer Science (R0)