Abstract
One of the most common frameworks for specifying workflows is control flow graph [3,11,13,22]. Although a control flow graph can depict local execution dependencies of the tasks in a workflow, it is not capable of expressing global dependencies and is not helpful in reasoning about workflow properties. Recently, a path constraint theory has been developed for semistructured data [2,7,8,9,10]. It has proven useful for semantic specification and query optimization in the database context. To overcome the limitations of flow control graphs, this paper generalizes the path constraint theory to specify and analyze workflows. More specifically, it proposes a path constraint language and shows that both local and global dependencies, as well as sub-workflows, can be naturally expressed in the language. This allows one to reason about workflows in the traditional logic framework. The paper also establishes the decidability of several verification problems associated with workflows.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Vianu, V.: Regular path queries with constraints. In: Proc. 16th ACM Symp. on Principles of Database Systems, PODS 1997 (1997)
Alonso, G., Agrawal, D., El Abbadi, A., Kamath, M., Günthör, R., Mohan, C.: Advanced transaction models in workflow contexts. In: Proc. 12th Intl. Conf. on Data Engineering, ICDE 1996 (1996)
Andréka, H., van Benthem, J., Németi, I.: Back and forth between modal logic and classical logic. Bulletin of the IGPL 3(5), 685–720 (1995)
Bonner, A.J.: Workflow, transactions and datalog. In: Proc. 18th ACM Symp. On Principles of Database Systems, PODS 1999 (1999)
Börger, E., Grädel, E., Gurevich, Y.: The classical decision problem. Springer, Heidelberg (1997)
Buneman, P., Fan, W., Weinstein, S.: Path constraints on semistructured and structured data. In: Proc. 17th ACM Symp. on Principles of Database Systems, PODS 1998 (1998)
Buneman, P., Fan, W., Weinstein, S.: Interaction between path and type constraints. In: Proc. 18th ACM Symp. on Principles of Database Systems (PODS 1999) (1999)
Buneman, P., Fan, W., Weinstein, S.: Query optimization for semistructured data using path constraints in a deterministic data model. In: Connor, R.C.H., Mendelzon, A.O. (eds.) DBPL 1999. LNCS, vol. 1949, p. 208. Springer, Heidelberg (2000)
Buneman, P., Fan, W., Weinstein, S.: Path constraints in semistructured databases. J. Comput. System Sci. (JCSS) (to appear)
Davulcu, H., Kifer, M., Ramakrishnan, C.R., Ramakrishnan, I.V.: Logic based modeling and analysis of workflows. In: Proc. 17th ACM Symp. on Principles of Database Systems, PODS 1998 (1998)
Enderton, H.B.: A mathematical introduction to logic. Academic Press, London (1972)
Georgakopoulos, D., Hornick, M., Sheth, A.: An overview of workflow management: From process modeling to workflow automation infrastructure. Distributed and Parallel Databases 3(2), 119–153 (1995)
ter Hofstede, A.H.M., Orlowska, M.E., Rajapakse, J.: Verification problems in conceptual workflow specifications. Data & Knowledge Engineering (DKE) 24(3), 239–256 (1998)
Hollingsworth, D.: The workflow reference model. WfMC standard TC00-1003 (1995), Available from http://www.aiim.org/wfmc/mainframe.htm
Klein, J.: Advanced rule-driven transaction management. In: IEEE COMPCON (1991)
Singh, M.P.: Semantical considerations on workflows: An algebra for intertask dependencies. In: Proc. 5th Intl. Workshop on Database Programming Languages, DBPL 1995 (1995)
Singh, M.P.: Synthesizing distributed constrained events from transactional workflow specifications. In: Proc. 12th IEEE Intl. Conf. on Data Engineering, ICDE 1996 (1996)
Wodtke, D., Weikum, G.: A formal foundation for distributed workflow execution based on state charts. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fan, W., Weinstein, S. (1999). Specifying and Reasoning about Workflows with Path Constraints. In: Hui, L.C.K., Lee, DL. (eds) Internet Applications. ICSC 1999. Lecture Notes in Computer Science, vol 1749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46652-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-46652-9_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66903-6
Online ISBN: 978-3-540-46652-9
eBook Packages: Springer Book Archive