National Changhua University of Education Institutional Repository : Item 987654321/11694

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 29961795 Online Users : 499

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Engineering > Department and Graduate Institute of Computer Science and Information Engineering > Periodical Articles > Item 987654321/11694

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/11694

Title:	A high-level petri nets based approach to verifying task structures
Authors:	Lee, Jonathan;Lai, Lien-Fu
Contributors:	資訊工程學系
Date:	2002-03
Issue Date:	2012-07-02T02:01:56Z
Publisher:	IEEE Computer Society
Abstract:	As knowledge-based system technology gains wider acceptance, there is an increasing need to verify knowledge-based systems to improve their reliability and quality. Traditionally, attention has been given to verifying knowledge-based systems at the knowledge level, which only addresses structural errors such as redundancy, conflict and circularity in rule bases. No semantic errors (such as inconsistency at the requirements specification level) have been checked. In this paper, we propose the use of task structures for modeling user requirements and domain knowledge at the requirements specification level, and the use of high-level Petri nets for expressing and verifying the task structure-based specifications. Issues in mapping task structures onto high-level Petri nets are identified, e.g. the representation of task decomposition, constraints and the state model; the distinction between the "follow" and "immediately follow" operators; and the "composition" operator in task structures. The verification of task structures using high-level Petri nets is performed on model specifications of a task through constraint satisfaction and relaxation techniques, and on process specifications of the task based on the reachability property and the notion of specificity
Relation:	IEEE Transactions on Knowledge and Data Engineering, 14(2): 316-335
Appears in Collections:	[Department and Graduate Institute of Computer Science and Information Engineering] Periodical Articles

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	566	View/Open

Loading...