Keyword : timed Petri nets


Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets
Satoru OCHIIWA Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/02/01
Vol. E96-A  No. 2 ; pp. 540-553
Type of Manuscript:  Special Section PAPER (Special Section on Mathematical Systems Science and its Applications)
Category: Algorithms and Data Structures
Keyword: 
timed Petri netslegal firing sequence problemsdeficient siphonsheuristic algorithmsperformance evaluation
 Summary | Full Text:PDF(892.5KB)

An Efficient Translation Method from Timed Petri Nets to Timed Automata
Shota NAKANO Shingo YAMAGUCHI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2012/08/01
Vol. E95-A  No. 8 ; pp. 1402-1411
Type of Manuscript:  PAPER
Category: Concurrent Systems
Keyword: 
timed Petri netstimed automatathe amount of descriptionmodel checkingsignaling pathway
 Summary | Full Text:PDF(1.1MB)

Propositional Temporal Linear Logic and Its Application to Concurrent Systems
Takaharu HIRAI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/11/25
Vol. E83-A  No. 11 ; pp. 2219-2227
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent Systems Technology)
Category: 
Keyword: 
temporal linear logicconcurrent systemssynchronous communicationtimed Petri netsreachability
 Summary | Full Text:PDF(292.7KB)

Priority-List Scheduling in Timed Petri Nets
Takenobu TANIDA Toshimasa WATANABE Masahiro YAMAUCHI Kinji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/10/25
Vol. E75-A  No. 10 ; pp. 1394-1406
Type of Manuscript:  Special Section PAPER (Special Section on Application of Petri Nets to Concurrent System Design)
Category: 
Keyword: 
schedulingpriority-listsapproximation algorithmstimed Petri nets
 Summary | Full Text:PDF(987.1KB)

The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets
Toshimasa WATANABE Takenobu TANIDA Masahiro YAMAUCHI Kenji ONAGA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/10/25
Vol. E75-A  No. 10 ; pp. 1407-1421
Type of Manuscript:  Special Section PAPER (Special Section on Application of Petri Nets to Concurrent System Design)
Category: 
Keyword: 
timed Petri netsschedulingapproximation algorithmstime complexityNP-hardness
 Summary | Full Text:PDF(1.1MB)