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 2011-11-18 11:15
On Reachability Verification for Acyclic Well-Structured Work
Shinji Hamano, Shingo Yamaguchi (Yamaguchi Univ.) CAS2011-78 MSS2011-47
Abstract (in Japanese) (See Japanese page) 
(in English) Workflow nets are making great contributions for modeling and analysis of workflows.
In this paper, we tackle verification of correctness of workflow instances by using reachability. Reachability is a basic property,but its verification is known to be intractable.
There is a subclass of workflow nets which is called well-structured.
Limiting our analysis to acyclic well-structured workflow nets, we
propose a necessary and sufficient condition on the reachability, and
construct a polynomial time algorithm based on the condition.
Keyword (in Japanese) (See Japanese page) 
(in English) workflow nets / well-structured / reachability / polynomial-time algorithm / necessary and sufficient condition / / /  
Reference Info. IEICE Tech. Rep., vol. 111, no. 294, MSS2011-47, pp. 83-87, Nov. 2011.
Paper # MSS2011-47 
Date of Issue 2011-11-10 (CAS, MSS) 
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 CAS2011-78 MSS2011-47

Conference Information
Committee CAS MSS  
Conference Date 2011-11-17 - 2011-11-18 
Place (in Japanese) (See Japanese page) 
Place (in English) Univ. of Yamaguchi 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Graph, Petri Net, Neural network, etc 
Paper Information
Registration To MSS 
Conference Code 2011-11-CAS-MSS 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On Reachability Verification for Acyclic Well-Structured Work 
Sub Title (in English)  
Keyword(1) workflow nets  
Keyword(2) well-structured  
Keyword(3) reachability  
Keyword(4) polynomial-time algorithm  
Keyword(5) necessary and sufficient condition  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Shinji Hamano  
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  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
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 ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2011-11-18 11:15:00 
Presentation Time 25 minutes 
Registration for MSS 
Paper # CAS2011-78, MSS2011-47 
Volume (vol) vol.111 
Number (no) no.293(CAS), no.294(MSS) 
Page pp.83-87 
#Pages
Date of Issue 2011-11-10 (CAS, MSS) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan