Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Articles by Yuyue Du
Total Records ( 11 ) for Yuyue Du
  WenJuan Lian , Hao Fan , YuYue Du and YongQuan Liang
  It has been proved that regular language is a subclass of Petri net languages. Standard properly end Petri net, a subclass of Petri nets is defined in the related references, and the equivalency between a standard properly end Petri net and a regular language has been investigated. Thus, the Petri net constructing methods of Kleene closure operations with and without an ε-empty label in regular expressions are presented respectively in this study. By the methods, the net model of producing regular language L* can be constructed from that of producing regular language L. It is proved that a standard properly end Petri net language of Kleene closure operations is close.
  Yuyue Du , Hong Zheng and Shuxia Yu
  A dynamic stock trading system with a distributed shared memory is analyzed formally based on its temporal Petri net model. The functional correctness of the system is formally verified and some important properties of the system are investigated, such as liveness, fairness, safeness and temporal properties. Finally, conclusions are found.
  Wei Liu , Yuyue Du and Haichun Sun
  Interorganizational Logical Workflow Nets (ILWN) can efficiently model cooperative systems based on Petri nets, workflow techniques and temporal logic. But soundness of arbitrary ILWNs is hard to decide. This study defines the concept of T-restricted Logical Workflow Nets (LWN) and proposes an important subclass of ILWNs composed of n T-restricted LWNs: T-restricted ILWNs. The sufficient and necessary conditions of T-restricted ILWNs preserving soundness are obtained and the rigorous analysis approach is presented based on their static net structures only. Moreover, two approaches of combining n T-restricted LWNs into one T-restricted ILWN are given. The concepts and techniques proposed in this study are illustrated with a useful example of an auto gas station system.
  Wei Liu and Yuyue Du
  In this study, Logical Time Interaction Petri Nets (LTIPN) were designed to describe multimedia synchronization based on the previous models. In the model, we introduce logical expressions which are used to describe passing value indeterminacy in an logical time Petri net to model multimedia synchronization. And all multimedia synchronization events including multimedia objects are expressed by transitions of Petri nets, while the previous models mostly use places of Petri nets to express multimedia objects. This study provides users simple and intuitive modeling approaches. Basic temporal relations between multimedia objects, multimedia synchronization strategies and user interactive operations can be represented simply and explicitly by the LTIPN.
  FuXin Zhang and YuYue Du
  To make workflow processes more flexible, a dynamic generation approach for workflow processes corresponding to an instance is presented in this study. An activity, a part of a workflow, is defined as an action based on Description Logics (DLs). User preferences are considered, since a final solution should satisfy user preferences as much as possible. Also, a hierarchical workflow ontology model is proposed and a deciding method for basic routing relations in workflows is provided to produce the processes completely. Then for generating the processes, a new planning algorithm of workflow processes, DPWPG: Dynamic Planning for Workflow Process Generation, is presented and used to search matching activities in a workflow ontology model, according to ontological reasoning in semantic activities and users’ preferences. Finally, an example is given to test the performance of the planning algorithm.
  Peng Li and Yuyue Du
  A rapidly changing environment forces the workflow management systems to change their workflow processes ever more frequently. In order to improve the flexibility of workflow management systems, a dynamic workflow model is proposed in this study. The concepts of flexible activities and historical execution information are put forward to construct dynamic workflow models in this method. Each flexible activity is used to encapsulate a group of indeterminate factors, e.g., the constraint rules and optional sub-activities when reifying a flexible activity. Historical execution information is the executive logging of a previous workflow instance. Two algorithms are put forward to guarantee the correctness of sub-workflows and the global control of dynamic processes. Furthermore, a simple example is given to validate the proposed dynamic workflow model. However, this method cannot perform well if there existing loop structures in sub-workflows and the reifying processes of flexible activities are not intelligent enough.
  Yuyue Du , Changjun Jiang and Yubin Guo
  Grid computing enables the virtualization of distributed computing and data resources to create a single system image, granting users and applications seamless access to vast IT capabilities. Grid architecture is a new software environment that developed to furnish users with grid computing platform that applications can access distributed resources through a well controlled, secure and mutually fair way. In this study a formal model based on Logical Petri Nets (LPNs) for grid architecture is proposed. Using this model, both static structure and dynamic behavior can be simulated and analyzed. The LPN model of grid architecture is constructed and causality relationship between the actions of grid components can be explicitly described. Based on this model, main properties of this grid structure is analyzed and verified formally.
  Xingzhen Bai , Yongfa Hong , Yuyue Du and Zhengzhong Gao
  Due to the rapid network topology change of vehicular ad hoc networks (VANETs), the implementation of reliable data dissemination among vehicles has encountered many challenges. In this study, the Hierarchical Assisted-node-based Data Dissemination Scheme (HADD) of VANETs is presented. Since the vehicle mobility is limited to the road layout, the relative locations among vehicles are partially predictable. In our scheme, the location predictability among neighbor vehicles is taken into consideration to reduce the communication failure caused by the rapid change of the relative locations. Considering the drivers’ requirement degree for the data source information varies with different distances, the amount of data is customized according to the different requirements in order to reduce the channel conflict and increase the data dissemination efficiency. Simulation results show that the novel scheme can obviously improve the network performance of data dissemination rate and delay.
  Jianxin Liu , Yuyue Du , Peng Li and Yongfa Hong
  This study first introduces the operation flow of the container port and port business subsystems, then establishes, on the container dock operation system, integration model, berth system model and loading/unloading operation system model by using Petri net modeling technology. The model is analyzed, given the nature of model and verified. The modeling approach makes dynamic model and function running of the system closely linked and set the stage for analyzing the dynamic characteristics of the system, So as to facilitate the improvement and optimization of practical business system.
  Sha Jing and Yuyue Du
  As more and more event data become available, the practical relevance of data mining process is increasing. Process mining techniques aim to discover, monitor and improve real processes by extracting knowledge from event logs. A large volume of event data provides both opportunities and challenges for data mining process. The present process mining techniques have problems dealing with large event logs referring to many different activities. Therefore, we propose a generic approach to decompose process mining problems. It is possible to split computationally challenging process mining problems into many smaller problems that can be analyzed easily and whose results can be combined into solutions for the original problems. We present the matching algorithms to decompose the whole process model into several groups of traces and the numerical analysis of data mining models based on Stochastic Wellformed Workflow (SWWF).
  YuHui Ning , YuYue Du and ShuXia Yu
  With the development of information technology, the quantity of web services in internet has increased rapidly. The time complexity of service composition becomes higher. To solve this problem, a new method of service composition is proposed based on Enhanced Logic Petri nets (ELPNs) in this study. The main innovation is the construction of a composition library. The experiment in this study shows the time complexity of service composition is decreased. Firstly, web services and service compostion are modeled by ELPNs. Then, the reachability of ELPNs is analyzed. All cases of service composition are obtained based on the ELPNs model of service composition. A composition library is constructed. The method of service composition is proposed based on the composition library. Moreover, some theorems are given, such as enabled conditions of transitions, marking computing. Some algorithms are introduced, such as reachable markings, service composition and so on. Finally, the validity and advantages of proposed methods are illustrated by experiments and comparative analysis.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility