Formalizing the specification and execution of workflows using the event calculus

Download

index.pdf

Date

2006-08-03

Author

Çiçekli, Fehime Nihan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

234
views

0
downloads

The event calculus is a logic programming formalism for representing events and their effects especially in database applications. This paper proposes the event calculus as a logic-based methodology for the specification and execution of workflows. It is shown that the control flow graph of a workflow specification can be expressed as a set of logical formulas and the event calculus can be used to specify the role of a workflow manager through a set of rules for the execution dependencies of activities. The proposed framework for a workflow manager maintains a history of events to control the execution of activities. The events are instructions to the workflow manager to coordinate the execution of activities. Based on the already occurred events, the workflow manager triggers new events to schedule new activities in accordance with the control flow graph of the workflow. The net effect is an alternative approach for defining a workflow engine whose operational semantics is naturally integrated with the operational semantics of a deductive database. Within this framework it is possible to model sequential and concurrent activities with or without synchronization. It is also possible to model agent assignment and execution of concurrent workflow instances. The paper, thus, contributes a logical perspective to the task of developing formalization for the workflow management systems.

Subject Keywords

Control and Systems Engineering, Theoretical Computer Science, Software, Information Systems and Management, Artificial Intelligence, Computer Science Applications

URI

https://hdl.handle.net/11511/62707

Journal

INFORMATION SCIENCES

DOI

https://doi.org/10.1016/j.ins.2005.10.007

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

An access structure for similarity-based fuzzy databases Yazıcı, Adnan (Elsevier BV, 1999-04-01) A significant effort has been made in representing imprecise information in database models by using fuzzy set theory. However, the research directed toward access structures to handle fuzzy querying effectively is still at an immature stage. Fuzzy querying involves more complex processing than the ordinary querying does. Additionally, a larger number of tuples are possibly selected by fuzzy conditions in comparison to the crisp ones. It is obvious that the need for fast response time becomes very important...
Verification and transformation of complex and uncertain conceptual schemas Yazıcı, Adnan (World Scientific Pub Co Pte Lt, 1997-12-01) In database environment it is necessary to represent complex and uncertain information at conceptual level and then transform the conceptual schema into the logical one for ultimate implementation. It is also important to verify the conceptual schema with respect to the constraints imposed on the schema definition. In this paper we primarily focus on the verification and transformation of the conceptual schema For the purpose of verification of the conceptual schema represented by the ExIFO data model (the ...
Learning customized and optimized lists of rules with mathematical programming Rudin, Cynthia; Ertekin Bolelli, Şeyda (Springer Science and Business Media LLC, 2018-12-01) We introduce a mathematical programming approach to building rule lists, which are a type of interpretable, nonlinear, and logical machine learning classifier involving IF-THEN rules. Unlike traditional decision tree algorithms like CART and C5.0, this method does not use greedy splitting and pruning. Instead, it aims to fully optimize a combination of accuracy and sparsity, obeying user-defined constraints. This method is useful for producing non-black-box predictive models, and has the benefit of a clear ...
A finite field framework for modeling, analysis and control of finite state automata Reger, Johann; Schmidt, Klaus Verner (Informa UK Limited, 2004-09-01) In this paper, we address the modeling, analysis and control of finite state automata, which represent a standard class of discrete event systems. As opposed to graph theoretical methods, we consider an algebraic framework that resides on the finite field F-2 which is defined on a set of two elements with the operations addition and multiplication, both carried out modulo 2. The key characteristic of the model is its functional completeness in the sense that it is capable of describing most of the finite st...
Observability Through a Matrix-Weighted Graph Tuna, Sezai Emre (Institute of Electrical and Electronics Engineers (IEEE), 2018-07-01) Observability of an array of identical linear time-invariant systems with incommensurable output matrices is studied, where an array is called observable when identically zero relative outputs imply synchronized solutions for the individual systems. It is shown that the observability of an array is equivalent to the connectivity of its interconnection graph, whose edges are assigned matrix weights. Moreover, to better understand the relative behavior of distant units, pairwise observability that concerns wi...

Citation Formats

F. N. Çiçekli, “Formalizing the specification and execution of workflows using the event calculus,” INFORMATION SCIENCES, pp. 2227–2267, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62707.