A group learning management method for intelligent tutoring systems

In this paper we propose a group management specification and execution method that seeks a compromise between simple course design and complex adaptive group interaction. This is achieved through an authoring method that proposes predefined scenarios to the author. These scenarios already include complex learning interaction protocols in which student and group models use and update are automatically included. The method adopts ontologies to represent domain and student models, and object Petri nets to specify the group interaction protocols. During execution, the method is supported by a multi-agent architecture

Utilizing semantic networks to database and retrieve generalized stochastic colored Petri nets

Previous work has introduced the Planning Coordinator (PCOORD), a coordinator functioning within the hierarchy of the Intelligent Machine Mode. Within the structure of the Planning Coordinator resides the Primitive Structure Database (PSDB) functioning to provide the primitive structures utilized by the Planning Coordinator in the establishing of error recovery or on-line path plans. This report further explores the Primitive Structure Database and establishes the potential of utilizing semantic networks as a means of efficiently storing and retrieving the Generalized Stochastic Colored Petri Nets from which the error recovery plans are derived

Workflow resource pattern modelling and visualization

Workflow patterns have been recognized as the theoretical basis to modeling recurring problems in workflow systems. A form of workflow patterns, known as the resource patterns, characterise the behaviour of resources in workflow systems. Despite the fact that many resource patterns have been discovered, people still preclude them from many workflow system implementations. One of reasons could be obscurityin the behaviour of and interaction between resources and a workflow management system. Thus, we provide a modelling and visualization approach for the resource patterns, enabling a resource behaviour modeller to intuitively see the specific resource patterns involved in the lifecycle of a workitem. We believe this research can be extended to benefit not only workflow modelling, but also other applications, such as model validation, human resource behaviour modelling, and workflow model visualization

Abridged Petri Nets

A new graphical framework, Abridged Petri Nets (APNs) is introduced for bottom-up modeling of complex stochastic systems. APNs are similar to Stochastic Petri Nets (SPNs) in as much as they both rely on component-based representation of system state space, in contrast to Markov chains that explicitly model the states of an entire system. In both frameworks, so-called tokens (denoted as small circles) represent individual entities comprising the system; however, SPN graphs contain two distinct types of nodes (called places and transitions) with transitions serving the purpose of routing tokens among places. As a result, a pair of place nodes in SPNs can be linked to each other only via a transient stop, a transition node. In contrast, APN graphs link place nodes directly by arcs (transitions), similar to state space diagrams for Markov chains, and separate transition nodes are not needed. Tokens in APN are distinct and have labels that can assume both discrete values ("colors") and continuous values ("ages"), both of which can change during simulation. Component interactions are modeled in APNs using triggers, which are either inhibitors or enablers (the inhibitors' opposites). Hierarchical construction of APNs rely on using stacks (layers) of submodels with automatically matching color policies. As a result, APNs provide at least the same modeling power as SPNs, but, as demonstrated by means of several examples, the resulting models are often more compact and transparent, therefore facilitating more efficient performance evaluation of complex systems.Comment: 17 figure

Process Mining of Programmable Logic Controllers: Input/Output Event Logs

This paper presents an approach to model an unknown Ladder Logic based Programmable Logic Controller (PLC) program consisting of Boolean logic and counters using Process Mining techniques. First, we tap the inputs and outputs of a PLC to create a data flow log. Second, we propose a method to translate the obtained data flow log to an event log suitable for Process Mining. In a third step, we propose a hybrid Petri net (PN) and neural network approach to approximate the logic of the actual underlying PLC program. We demonstrate the applicability of our proposed approach on a case study with three simulated scenarios

Eighth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, October 22-24, 2007

This booklet contains the proceedings of the Eighth Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, October 22-24, 2007. The workshop is organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark. The papers are also available in electronic form via the web pages: http://www.daimi.au.dk/CPnets/workshop0

Development of a conceptual model of adaptive access rights management with using the apparatus of Petri nets

The paper describes the conceptual model of adaptive control of cyber protection of the informatization object (IO). Petri's Networks were used as a mathematical device to solve the problem of adaptive control of user access rights. The simulation model is proposed and the simulation in PIPE v4.3.0 package is performed. The possibility of automating the procedures for adjusting the user profile to minimize or neutralize cyber threats in the objects of informatization is shown. The model of distribution of user tasks in computer networks of IO is proposed. The model, unlike the existing, is based on the mathematical apparatus of Petri's Networks and contains variables that allow reducing the power of the state space. Access control method (ACM) is added. The addenda touched upon aspects of reconciliation of access rights that are requested by the task and requirements of the security policy and the degree of consistency of tasks and access to the IO nodes. Adjustment of rules and security metrics for new tasks or redistributable tasks is described in the notation of Petri nets