Using a temporal constraint network for business process execution

Conferences in Research and Practice in Information Technology Series

Volumn 49, Issue , 2006, Pages 157-166

  Lu, Ruopeng ^a   Sadiq, Shazia ^a   Padmanabhan, Vineet ^a   Governatori, Guido ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Constraint satisfaction; Process modelling; Temporal constraints; Workflows

Indexed keywords

BUSINESS PROCESS; BUSINESS PROCESS EXECUTION; BUSINESS PROCESS MANAGEMENT; BUSINESS SOLUTIONS; CONSTRAINT SATISFACTION; CONTROL FLOWS; DYNAMIC BUSINESS ENVIRONMENT; DYNAMIC CHANGES; ENTERPRISE SYSTEM; GRAPHICAL LANGUAGES; IN-PROCESS; INCREASED FLEXIBILITY; KEY FEATURE; MODELLING FRAMEWORK; PROCESS CONSTRAINTS; PROCESS MODELLING; SCHEDULING CONSTRAINTS; TASK SELECTION; TEMPORAL CONSTRAINTS; VISUAL APPEALS; WORK-FLOWS;

ENTERPRISE RESOURCE MANAGEMENT; PROCESS ENGINEERING;

VISUAL LANGUAGES;

EID: 38749121586     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

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\ 6.
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, Accessed 2005. http://www.econ.uba.ar/servicios/publicaciones/journal7/tsang.htm
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: Interface 1: Process Definition Interchange, Process Model, Workflow Management Coalition. (1998)
34. Yokoo, M. (2001): Distributed Constraint Satisfaction, Springer.