A workflow is an automation of a process, in which agents (people or programs) are involved in activities for solving a set of tasks in order to attain a common goal. The concept of workflow appeared in business informatics. Currently, the workflow techniques are used in many other fields of informatics (medical and bioinformatics, organization of scientific researches, computer-aided design and manufacturing, robotics et al,) Many methods and formalisms were applied for specifying workflows. Specific logical languages were used for this. In particular, temporal logics are popular as workflow specification formalisms. Allen’s interval logic is the simplest temporal logic, but only a few kinds of qualitative properties can be specified for workflows, We define a metric extension of Allen’s interval logic and show how to use it for specifying workflows. We construct an inference method for this formalism. The method is based on the analytic tableaux techniques. We also show how to use the inference method for query answering over workflows schemas and their states.
A workflow is an automation of a process, in which agents (people or programs) are involved in activities for solving a set of tasks in order to attain a common goal. The concept of workflow appeared in business informatics. Currently, the workflow techniques are used in many other fields of informatics (medical and bioinformatics, organization of scientific researches, computer-aided design and manufacturing, robotics et al,) Many methods and formalisms were applied for specifying workflows. Specific logical languages were used for this. In particular, temporal logics are popular as workflow specification formalisms. Allen’s interval logic is the simplest temporal logic, but only a few kinds of qualitative properties can be specified for workflows, We define a metric extension of Allen’s interval logic and show how to use it for specifying workflows. We construct an inference method for this formalism. The method is based on the analytic tableaux techniques. We also show how to use the inference method for query answering over workflows schemas and their states.
| № | Имя автора | Должность | Наименование организации |
|---|---|---|---|
| 1 | Plesniewicz G.S. | Applied Mathematical Department of National Research University (MPEI), Russian Federation, Address: 111250, Krasnokazarmennaya str., 14, Moscow, Russia E-mail: salve777@mail.ru | Applied Mathematical Department of National Research University (MPEI), Russian Federation, |
| № | Название ссылки |
|---|---|
| 1 | 1. D’Aggostino M., Gabbay D., Hahnle R., Possega J.(eds.). Handbook of Tableaux Methods.- Kluwer Academic Publishers.- 1999.- p. 612 2. Allen J.A. Maintaining knowledge about temporal intervals // Communications of the ACM, - 1983. – Vol.26,- No.-11.- pp. 832-843. 3. Allen J.F. Towards a general theory of action and time // Artificial Intelligence.- 1984.- Vol. 23.- No.1.- pp. 123154. 4. Allen, J. F. and Ferguson, G. Actions and events in interval temporal logic // Journal of Logic and Computation.- 1994.- Vol.4.- No.6.- 531-579. 5. Alonso, G.F., Casati, F., Kuno, H., Machiraju, V. Web Services: concepts, architectures and applications.- Springer-Verlag.- 2003.- 378 p. 6. Dumas M., Van der Aalst W.M.P., Ter Hofstede A.H.M.(eds.). Process-Aware Information Systems.- Wiley & Sons, inc.- 2005.- 217 p. 7. Gil Y., Deelman E., Ellisman E., Fahringer M., Fox T., Gannon D., Goble C., Livny M., Moreau L., Myers J. Examining the Challenges of Scientific Workflows // IEEE Computer.- 2007.- Vol. 40.- No.1.- pp.26-34. 8. Ma H., A workflow model based on temporal logic // Proceedings of the 8th International Conference on Computer Supported Cooperative Work in Design, IEEE.- 2004.- pp. 327-332. 9. Matschiner M., Satzburger W., TANDEM: integrated allele binning into genetics and genomics workflows // Bioinformatics.- 2009.- Vol.25.- No.8.- pp. 1982-1997. 10. Van der Aalst, W.H.P., Van Hee, K.M. Workflow Management: Models, Methods and Systems. - MIT Press, Cambridge, USA.- 2002.- 443 p. |