Supporting adaptive learning with high level timed petri nets

Supporting adaptive learning is one of the key problems for hypertext-based learning applications. This paper proposed a timed Petri Net based approach that provides adaptation to learning activities by controlling the visualization of hypertext information nodes. Simple examples were given while explaining ways to realize adaptive operations. Future directions were also discussed at the end of this paper.

Supporting adaptive learning in hypertext environment : a high level timed Petri net based approach

One problem for hypertext-based learning application is to control learning paths for different learning activities. This paper first introduced related concepts of hypertext learning state space and Petri net, then proposed a high level timed Petri Net based approach to provide some kinds of adaptation for learning activities. Examples were given while explaining ways to realizing adaptive instructions. Possible future directions were also discussed at the end of this paper.

Enhancing web-based adaptive learning with colored timed petri net

One of the issues for Web-based learning applications is to adaptively provide personalized instructions for different learning activities. This paper proposes a high level colored timed Petri Net based approach to providing some level of adaptation for different users and learning activities. Examples are given to demonstrate how to realize adaptive interfaces and personalization. Future directions are also discussed at the end of this paper.

Supporting adaptive learning in hypertext environments : a high level timed Petri net-based approach

A problem for hypertext-based learning application is to control learning paths for different learning activities. This paper first introduces related concepts of hypertext learning state space and high level Petri Nets (PNs), then proposes a high level timed PN based approach used to providing kinds of adaptation for learning activities by adjusting time attributes of targeted learning state space. Examples are given while explaining ways to realising adaptive instructions. Possible future directions are also discussed at the end of this paper.

Prototyping real-time systems using Petri net and object-oriented models

The objective of the research for this thesis is to develop techniques in order to build an executable model of a real-time system. This model is to be used early in the development of the system not only to detect errors in the specification of the system but also to validate expectations of the developer as to the operation of the system. A graphical specification of a real-time system called the transformation schema was chosen to be used to build the model. Two executable models of a real-time system are described.

Modeling and control of flatness in cold rolling mill using fuzzy petri nets

Today, having a good flatness control in steel industry is essential to ensure an overall product quality, productivity and successful processing. Flatness error, given as difference between measured strip flatness and target curve, can be minimized by modifying roll gap with various control functions. In most practical systems, knowing the definition of the model in order to have an acceptable control is essential. In this paper, a fuzzy Petri net method for modeling and control of flatness in cold rolling mill is developed. The method combines the concepts of Petri net and fuzzy control theories. It focuses on the fuzzy decision making problems of the fuzzy rule tree structures. The method is able to detect and recover possible errors that can occur in the fuzzy rule of the knowledge-based system. The method is implemented and simulated. The results show that its error is less than that of a PI conventional controller.

An efficient scheduling method for grid systems based on a hierarchical stochastic petri net

This paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.