[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/1151736.1151753dlproceedingsArticle/Chapter ViewAbstractPublication PagesadcConference Proceedingsconference-collections
Article
Free access

Using a temporal constraint network for business process execution

Published: 01 January 2006 Publication History

Abstract

Business process management (BPM) has emerged as a dominant technology in current enterprise systems and business solutions. However, the technology continues to face challenges in coping with dynamic business environments where requirements and goals are constantly changing. In this paper, we present a modelling framework for business processes that is conducive to dynamic change and the need for flexibility in execution. This framework is based on the notion of process constraints. Process constraints may be specified for any aspect of the process, such as task selection, control flow, resource allocation, etc. Our focus in this paper is on a set of scheduling constraints that are specified through a temporal constraint network. We will demonstrate how this specification can lead to increased flexibility in process execution, while maintaining a desired level of control. A key feature and strength of the approach is to use the power of constraints, while still preserving the intuition and visual appeal of graphical languages for process modelling.

References

[1]
Allen, J. F. (1983): Maintaining knowledge about temporal intervals. Communications of the ACM 26: 832-843.]]
[2]
Barták, R. (1999): Dynamic Constraint Models for Planning and Scheduling Problems. Lecture Notes In Computer Science; Vol. 1865, Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Constraints, Springer-Verlag London, UK: 237-255.]]
[3]
Beaumont, M., A. Sattar, et al. (2001): Solving Overconstrained Temporal Reasoning Problems. 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence, Springer-Verlag.]]
[4]
Bettini, C., X. S. Wang, et al. (2002): Temporal Reasoning in Workflow Systems. Distributed and Parallel Databases 11(3 (May 2002)): 269-307]]
[5]
Combi, C. and G. Pozzi (2003): Temporal Conceptual Modelling of Workflows. Lecture Notes in Computer Science, Springer-Verlag. 2813: 59 - 76.]]
[6]
Cook, S. A. and D. G. Mitchell (1997): Finding Hard Instances of the Satisfiability Problem: A Survey. The DIMACS Workshop on Satisfiability Problems, American Mathematical Society.]]
[7]
Crampton, J. (2004): On the satisfiability of authorization constraints in workflow systems. RHUL--MA--2004--1, Department of Mathematics, Royal Holloway, University of London.]]
[8]
Dechter, R. (2003): Constraint Processing, Morgan Kaufmann Publishers.]]
[9]
Dechter, R., I. Merir, et al. (1991): Temporal Constraint Networks. Artificial Intelligence 49: 61-95.]]
[10]
Drakengren, T. and P. Jonsson (1996): Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. AAAI/IAAI. Vol. 1: 389-394.]]
[11]
Drakengren, T. and P. Jonsson (1997): Towards a Complete Classification of Tractability in Allen's Algebra. IJCAI: 1466-1475.]]
[12]
Eder, J., W. Gruber, et al. (2000): Temporal Modeling of Workflows with Conditional Execution Paths. Database and Expert Systems Applications: 11th International Conference, DEXA 2000, London, UK, Springer-Verlag GmbH.]]
[13]
Eder, J., E. Panagos, et al. (1999): Time Constraints in Workflow Systems. Advanced Information Systems Engineering: 11th International Conference, CAiSE'99, Heidelberg, Germany, Springer-Verlag GmbH.]]
[14]
Jablonski, S. and C. Bussler (1996): Workflow Management - Modeling Concepts, Architecture and Implementation, International Thomson Computer Press.]]
[15]
Jeavons, P. (1999): Constructing Constraints. The 4th International Conference on Principles and Practice of Constraint Programming, Springer-Verlag.]]
[16]
Jonsson, P., T. Drakengren, et al. (1996): Tractable subclasses of the point-interval algebra: A complete classification. KR'96, AAAI Press/The MIT Press.]]
[17]
Li, H. and Y. Yang (2004): Dynamic checking of temporal constraints for concurrent workflow. Electronic Commerce Research and Applications 4(2005): 124-142.]]
[18]
Li, H. and Y. Yang (2004): Verification of Temporal Constraints for Concurrent Workflows. Advanced Web Technologies and Applications, 6th Asia-Pacific Web Conference, APWeb 2004, Hangzhou, China, Springer.]]
[19]
Marjanovic, O. (2000): Dynamic verification of temporal constraints in production workflows. Proceedings of 11th Australasian Database Conference, 2000. ADC 2000.]]
[20]
Marjanovic, O. and M. E. Orlowska (1999): Dynamic Verification of Absolute and Relative Deadline Constraints in Production Workflows, Technical Report, No. 446, Department of Computer Science and Electrical Engineering, University of Queensland, Australia.]]
[21]
Meiri, I. (1995): "Combining qualitative and quantitative constraints in temporal reasoning." Artificial Intelligence 87: 343-385.]]
[22]
Nebel, B. and H.-J. Buckert (1995): "Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra." Journal of ACM 42(1): 43-66.]]
[23]
Sadiq, W. and M. E. Orlowska (1999): On Capturing Process Requirements of Workflow Based Business Information System. 3rd International Conference on Business Information Systems (BIS '99), Poznan, Poland, Springer-Verlag.]]
[24]
Sadiq, W. and M. E. Orlowska (2000): "Analyzing Process Models using Graph Reduction Techniques." Information Systems 25(2): 117-134.]]
[25]
Schwalb, E. and L. Vila (1998): Temporal Constraints: A Survey. Constraints 3(2-3): 129-149.]]
[26]
Tan, K., J. Crampton, et al. (2004): The consistency of task-based authorization constraints in workflow systems . Proceedings of 17th IEEE Computer Security Foundations Workshop, 2004.]]
[27]
Tsang, E. P. K. (2003): Constraint Satisfaction in Business Process Modelling, http://www.econ.uba.ar/servicios/publicaciones/j ournal7/tsang.htm, Accessed 2005.]]
[28]
van Beek, P. (1989): Approximation algorithms for temporal reasoning. The 11th International Joint Conference on Artificial Intelligence, Detroit, Mich, Morgan Kaufmann.]]
[29]
van Beek, P. (1990): Exact and Approximate Reasoning about Qualitative Temporal Relations. Dept. of Computer Science, University of Alberta, PhD Thesis.]]
[30]
van Beek, P. (1992): "Reasoning about Qualitative Temporal Information." Artificial Intelligence 58: 297-326.]]
[31]
van der Aalst, W. M. P. (1996): Three Good reasons for Using a Petri-net-based Workflow Management System. Proceedings of the International Working Conference on Information and Process Integration in Enterprises (IPIC'96): S. Navathe and T. Wakayama. Camebridge, Massachusetts: 179-201.]]
[32]
Vilain, M., H. Kautz, et al. (1989): Constraint propagation algorithms for temporal reasoning: a revised report. Readings in qualitative reasoning about physical systems. San Francisco, CA, USA, Morgan Kaufmann Publishers Inc: 373--381.]]
[33]
WfMC (1998): Interface 1: Process Definition Interchange, Process Model, Workflow Management Coalition.]]
[34]
Yokoo, M. (2001): Distributed Constraint Satisfaction, Springer.]]

Cited By

View all
  • (2017)Dynamic temporal constraints in business processesProceedings of the Australasian Computer Science Week Multiconference10.1145/3014812.3014848(1-10)Online publication date: 30-Jan-2017
  • (2017)A Fresh Approach in the Optimization of Government Processes using AlgorithmsThe Electronic Journal of Information Systems in Developing Countries10.1002/j.1681-4835.2016.tb00554.x76:1(1-21)Online publication date: 5-Dec-2017
  • (2015)Process Discovery under Precedence ConstraintsACM Transactions on Knowledge Discovery from Data10.1145/27100209:4(1-39)Online publication date: 1-Jun-2015
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image DL Hosted proceedings
ADC '06: Proceedings of the 17th Australasian Database Conference - Volume 49
January 2006
202 pages
ISBN:1920682317

Publisher

Australian Computer Society, Inc.

Australia

Publication History

Published: 01 January 2006

Author Tags

  1. constraint satisfaction
  2. process modelling
  3. temporal constraints
  4. workflows

Qualifiers

  • Article

Conference

ADC '06
January 16 - 19, 2006
Hobart, Australia

Acceptance Rates

Overall Acceptance Rate 98 of 224 submissions, 44%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)48
  • Downloads (Last 6 weeks)8
Reflects downloads up to 07 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Dynamic temporal constraints in business processesProceedings of the Australasian Computer Science Week Multiconference10.1145/3014812.3014848(1-10)Online publication date: 30-Jan-2017
  • (2017)A Fresh Approach in the Optimization of Government Processes using AlgorithmsThe Electronic Journal of Information Systems in Developing Countries10.1002/j.1681-4835.2016.tb00554.x76:1(1-21)Online publication date: 5-Dec-2017
  • (2015)Process Discovery under Precedence ConstraintsACM Transactions on Knowledge Discovery from Data10.1145/27100209:4(1-39)Online publication date: 1-Jun-2015
  • (2015)The temporal perspective in business process modelingService Oriented Computing and Applications10.1007/s11761-014-0170-x9:1(75-85)Online publication date: 1-Mar-2015
  • (2010)Collaborative coordination of activities with temporal dependenciesProceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I10.5555/1947725.1947745(186-203)Online publication date: 25-Oct-2010
  • (2010)A conceptually rich model of business process complianceProceedings of the Seventh Asia-Pacific Conference on Conceptual Modelling - Volume 11010.5555/1862330.1862332(3-12)Online publication date: 1-Jan-2010
  • (2008)Non-functional requirements in business process modelingProceedings of the fifth Asia-Pacific conference on Conceptual Modelling - Volume 7910.5555/1379429.1379443(103-112)Online publication date: 1-Jan-2008
  • (2006)Managing process variants as an information resourceProceedings of the 4th international conference on Business Process Management10.1007/11841760_34(426-431)Online publication date: 5-Sep-2006

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media