Art

J-GLOBAL ID：201302277142553542   Reference number：13A1574657

The Liveness of WS³PR: Complexity and Decision

WS³PRの活性:複雑性および決定

Author (4)： LIU Guanjun (ISTD, Singapore Univ. of Technol. and Design) ,  JIANG Changjun (Key Lab. of the Ministry of Education for Embedded System and Serv. Computing, Tongji Univ.) ,  ZHOU Mengchu (Dep. of Electrical and Computer Engineering, New Jersey Inst. of Technol.) ,  OHTA Atsushi (School of Information Sci. and Technol., Aichi Prefectural Univ.)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E96-A  Issue： 8  Page： 1783-1793 (J-STAGE)  Publication year： 2013 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： sequential processing ,  *weighting ,  resource allocation ,  *activity (property) ,  computational complexity ,  NP hard ,  sufficient condition ,  necessary condition ,  siphon ,  deadlock ,  *Petri net
Semi thesaurus term： necessary and sufficient condition

JST classification (1)： Mathematical linguistics  (JB05000V)

Reference (32)：

• [1] W.M.P. van der Aalst, K. van Hee, A. ter Hofstede, N. Sidorova, H. Verbeek, M. Voorhoeve, and M. Wynn, “Soundness of workflow nets: Classification, decidability, and analysis,” Formal Aspects Computing, vol.23, pp.333-363, 2011.
• [2] K. Barkaoui, A. Chaoui, and B. Zouari, “Supervisory control of discrete event systems based on structure theory of Petri nets,” Proc. IEEE Int. Conf. Syst. Man Cybern., pp.3750-3755, 1997.
• [3] K. Barkaoui and J. Pradat-Peyre, “On liveness and controlled siphons in Petri nets,” Lect. Notes Comput. Sci., vol.1091, pp.57-72, 1996.
• [4] R.R. Brooks, M. Zhu, J. Lamb, and S.S. Iyengar, “Aspect-orienteddesign of sensor networks,” J. Parallel Distrib. Comput., vol.64, pp.853-865, 2004.
• [5] A. Cheng, J. Esparza, and J. Palsberg, “Complexity results for 1-safe nets,” Theor. Comput. Sci., vol.147, pp.117-136, 1995.

Terms in the title (2)： 活性 ,  複雑性