| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2007-11-29 13:25 A Heuristic Algorithm to Compute Parallel Degree of Well-Structured Workflow Nets by Considering Longest Path Yuji Kaneko, Shingo Yamaguchi, Qi-Wei Ge, Minoru Tanaka (Yamaguchi Univ.)  CAS2007-68 CST2007-19 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | In this paper, we propose a heuristic algorithm to compute parallel degree, PARAdeg, of a well-structured WF-net by considering its longest path.We first show properties of the longest path and PARAdeg, and then construct the algorithm from the properties. Next we compute PARAdeg of 200 well-structured WF-nets by using the proposed algorithm. From the computation results, we show accuracy of the proposed algorithm, and furthermore discuss characteristics of the proposed algorithm. |
|
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | WF-nets / well-structured / PARAdeg / heuristic algorithm / longest path / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 107, Nov. 2007. | |
| Paper # | ||
| Date of Issue | 2007-11-22 (CAS, CST) | |
| ISSN | Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | CAS2007-68 CST2007-19 |
|
| Conference Information | |
| Committee | MSS CAS |
| Conference Date | 2007-11-29 - 2007-11-30 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Niigata University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Graphs, Petri nets, Neural Networks |
| Paper Information | |
| Registration To | MSS |
| Conference Code | 2007-11-CST-CAS |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Heuristic Algorithm to Compute Parallel Degree of Well-Structured Workflow Nets by Considering Longest Path |
| Sub Title (in English) | |
| Keyword(1) | WF-nets |
| Keyword(2) | well-structured |
| Keyword(3) | PARAdeg |
| Keyword(4) | heuristic algorithm |
| Keyword(5) | longest path |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Yuji Kaneko |
| 1st Author's Affiliation | Yamaguchi University (Yamaguchi Univ.) |
| 2nd Author's Name | Shingo Yamaguchi |
| 2nd Author's Affiliation | Yamaguchi University (Yamaguchi Univ.) |
| 3rd Author's Name | Qi-Wei Ge |
| 3rd Author's Affiliation | Yamaguchi University (Yamaguchi Univ.) |
| 4th Author's Name | Minoru Tanaka |
| 4th Author's Affiliation | Yamaguchi University (Yamaguchi Univ.) |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2007-11-29 13:25:00 |
| Presentation Time | 25 minutes |
| Registration for | MSS |
| Paper # | CAS2007-68, CST2007-19 |
| Volume (vol) | vol.107 |
| Number (no) | no.361(CAS), no.363(CST) |
| Page | pp.7-10 |
| #Pages | 4 |
| Date of Issue | 2007-11-22 (CAS, CST) |
[Return to Top Page]