• Journal of Internet Computing and Services
• /
• v.14 no.2
• /
• pp.25-34
• /
• 2013

In this paper, we propose an activity-performer bipartite matrix generation algorithm for analyzing workflow-supported human-resource affiliations in a workflow model. The workflow-supported human-resource means that all performers of the organization managed by a workflow management system have to be affiliated with a certain set of activities in enacting the corresponding workflow model. We define an activity-performer affiliation network model that is a special type of social networks representing affiliation relationships between a group of performers and a group of activities in workflow models. The algorithm proposed in this paper generates a bipartite matrix from the activity-performer affiliation network model(APANM). Eventually, the generated activity-performer bipartite matrix can be used to analyze social network properties such as, centrality, density, and correlation, and to enable the organization to obtain the workflow-supported human-resource affiliations knowledge.

• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.59-66
• /
• 2015

A stochastic modeling approach as a mathematical method for workflow intelligence is widely used for analyzing and simulating workflow models in the literature. In particular, as a resource-centric modeling approach, this paper proposes a stochastic model to represent work-handover relationships between performers in a workflow-supported social network. Calculating probabilities for the work-handover relationships are determined by two types of probabilities. One is the work-transition probability between activities, and the other is the task assignment probability between activities and performers. In this paper, we describe formal definitions of stochastic workflow models and stochastic work-handover relationship models, as well. Then, we propose an algorithm for extracting a stochastic work-handover relationship model from a stochastic workflow model. As a consequence, the proposed model ought to be useful in performing resource-centric workflow simulations and model-log comparison analyses.

• Journal of Internet Computing and Services
• /
• v.13 no.2
• /
• pp.109-118
• /
• 2012

This paper theoretically derives an algorithm to discover a new type of workflow-based knowledge from workflow models, which is termed workflow-based affiliation network knowledge. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict a series of workflow-based knowledge from workflow models and their execution histories. So, this paper proposes a knowledge discovery algorithm which is able to discover workflow-based affiliation networks that represent the association and participation relationships between activities and performers defined in ICN-based workflow models. In order particularly to prove the correctness and feasibility of the proposed algorithm, this paper tries to apply the algorithm to a specific workflow model and to show that it is able to derive its corresponding workflow-based affiliation network knowledge.

• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.67-73
• /
• 2015

In this paper, we propose a disconnectedness determination algorithm for workflow-supported enterprise social networks. this networks can be discovered from the work-allocation relationships between activities and performers in workflow procedures and It networks are useful to analyze, evaluate and numerically explain the work-performance of performers. But there could be the disconnectedness due to the characteristics of workflow, and therefore analysis result of performers can be inappropriate logically as well as mathematically. So, we have to decide whether or not this network is disconnectedness before we analyze workflow-supported enterprise social networks. Conclusively, we try to carry out a thorough investigation into the formation reasons of the disconnectedness, and propose a determination algorithm of the disconnectedness for workflow-supported enterprise social networks.

• Annual Conference of KIPS
• /
• 2002.04a
• /
• pp.51-54
• /
• 2002

본 논문에서는 기업간의 비즈니스 프로세스의 자동화를 목적으로 하는 워크플로우 관리 시스템간의 상호 운영성을 지원하는 레지스트리 기반 기업간 워크플로우 모델링 도구를 설계하고 구현한다. 전자상거래를 대표하는 B2B (Business-to-Business) / B2E (Business-to-Enterprise) 환경에서 Interworkflow 메커니즘의 Cross Organizational 워크플로우 모델의 출현은 기업간 이질적인 환경에서의 조직과 시스템간의 상호운용성과 글로벌 워크플로우 관리를 가능하게 하였다. 이러한 메커니즘은 전자상거래의 발전에 많은 요소를 포함하고 있다. 본 논문에서는 Interworkflow 메커니즘의 Cross Organizational 워크플로우 모델의 연구를 통해 발전된 형태의 워크플로우 관리 시스템을 소개하고 또한 새로운 문제점을 제시한다. 또한 Interworkflow의 프로세스와 조직의 정의시 나타나는 문제점을 제시, 분석하고 이를 통해 발전된 형태의 레지스트리 기반 기업간 워크플로우 모델링 도구를 설계, 구현한다 이렇게 제시한 도구들을 통해 기업간 비즈니스 프로세스 자동화를 위한 전자상거래 워크플로우 관리 시스템 모델을 제시한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.484-486
• /
• 2004

유비쿼터스 컴퓨팅 환경의 워크플로우에서 컨텍스트 정보를 표현하기 위한 요구사항을 분석하고 이러한 요구사항을 만족하기 위한 트리플 구조(주어 동사 목적어) 기반의 단순 컨텍스트 모델과 합성 컨텍스트 모델을 제안한다. 제안한 워크플로우를 위한 컨텍스트 모델은 표현력이 강력하고, 확장이 쉽고, 재사용이 가능하며 인공지능적인 처리에 용이한 정보 구조를 제공한다.

• Journal of Internet Computing and Services
• /
• v.13 no.2
• /
• pp.73-86
• /
• 2012

This paper theoretically derives an algorithm to discover a new type of social networks from workflow models, which is termed workflow-based social network intelligence. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict from workflow models and their execution histories. So, this paper proposes an algorithm, which is termed ICN-based workflow-based social network intelligence discovery algorithm, to be classified into the type of discovery techniques, which are able to discover workflow-based social network intelligence that are formed among workflow performers through a series of workflow models and their executions, In order particularly to prove the correctness and feasibility of the proposed algorithm, this paper tries to apply the algorithm to a specific workflow model and to show that it is able to generate its corresponding workflow-based social network intelligence.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.677-687
• /
• 2001

The critical path has been widely applied to many areas of computer engineering especially a directed acyclic graph. Its concept can also be useful in the context of a workflow. The workflow critical path is defined as a path which has the longest average execution time from the start activity to the end activity of workflow. Because there can be several concurrently executed workflow instances for a specific workflow a new method to determine the critical path should be developed. In this paper we specify our workflow queuing network model from which we can easily analyze many workflow characteristics. Based on this workflow model. we propose a method to identify the critical path In addition, we show come workflow areas which can utilze the critical path.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.47-53
• /
• 2016

A type of workflow affiliation network is one of the specialized social network types, which represents the associative relation between actors and activities. There are many methods on a workflow affiliation network measuring centralities such as degree centrality, closeness centrality, betweenness centrality, eigenvector centrality. In particular, we are interested in the closeness centrality measurements on a workflow affiliation network discovered from enterprise workflow models, and we know that the time complexity problem is raised according to increasing the size of the workflow affiliation network. This paper proposes an estimated ranking algorithm and analyzes the accuracy and average computation time of the proposed algorithm. As a result, we show that the accuracy improves 47.5%, 29.44% in the sizes of network and the rates of samples, respectively. Also the estimated ranking algorithm's average computation time improves more than 82.40%, comparison with the original algorithm, when the network size is 2400, sampling rate is 30%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.127-129
• /
• 2004

비즈니스 프로세스의 정의 및 실행이 복잡화되고 대량화되면서, 비즈니스 프로세스를 좀더 효율적으로 개선하고자 하는 노력이 필요하게 되었다. 본 논문에서는 그러한 노력을 위해 도달가능경로를 이용한 워크플로우 마이닝 기법을 사용하여, 문제를 해결하고자 한다. 따라서, 본 논문에서는 워크플로우 마이닝을 하기 위하여, ICN(Information Control Net) 모델을 기반으로 정의된 프로세스 모델을 도달가늠경로를 찾아내기 위하여 WDN(Workflow Dependent Net)으로 구성을 한 후, MWN(Minimal Workflow Net)으로 변환하여, 도달가능경로를 구성할 수 있는 정보를 얻을 수 있도록 하는데 목적을 둔다.