行政院國家科學委員會專題研究計畫 期末報告
以最少顯示器達到最大許可的 Petri 網的一個子類的最快
死鎖防止方法
計 畫 類 別 ： 個別型 計 畫 編 號 ： NSC 101-2221-E-004-001- 執 行 期 間 ： 101 年 08 月 01 日至 102 年 07 月 31 日 執 行 單 位 ： 國立政治大學資訊管理學系 計 畫 主 持 人 ： 趙玉 計畫參與人員： 博士後研究：Gaiyun Liu 報 告 附 件 ： 出席國際會議研究心得報告及發表論文 公 開 資 訊 ： 本計畫涉及專利或其他智慧財產權，1 年後可公開查詢中 華 民 國 102 年 10 月 20 日
中 文 摘 要 ： 鎖死停止自動化系統對公司造成重大的財政損失。 學界使用 派翠網路把所有狀態找出(由狀態樹)便能找出死鎖原因。狀 態樹可分為好和壞兩區域，壞區域又可分為危險和死鎖區。 一旦進入危險區，便無可避免地走向死鎖區。死鎖防治是目 前普遍採用方法，加控制器以防止系統進入危險區。主要是 防治首次會見壞標記（First-met Bad Marking, FBM）的發 生，以減少控制器數目。最大許可和使用最少監控的最佳合 成控制器一直是一個熱門的課題。同時記憶體及 CPU 的使用 量也要越少越好。目前所有最大許可的死鎖防止方法都須依 靠狀態樹來列舉所有的狀態或混合整數規劃（MIP）測試。這 隨著派翠網路大小迅速(稱為指數型態)往上爆升而超過電腦 所能承擔。因此此類方法無法處理大型網路。其他方法亦有 類似問題。本人提議革命性的控制理論以線性複雜度找出所 有基本虹吸，進而以最少的控制器達到最大允許狀態，且能 避免電腦難以處理的指數型態(避免狀態樹建立) 。目前本人 已發展理論，找出由 N 個基本虹吸複合成區域死鎖所有標記 (Marking) 狀態。從而據此加入控制器。進一步，結合數個 控制器，以減少控制器，並達到最大允許狀態。本人提議結 合上述理論，直接由 N 個基本虹吸複合推導出最少控制器最 大允許，而無須找出死鎖所有標記及結合數個控制器之部 驟。這項建議達到最佳，並導致我們在該領域領先的學術地 位。它可以控制實時和在線時的大型網路。 中文關鍵詞： 派翠網，信標可控性，FMS，S3PR，死鎖，控制。
英 文 摘 要 ： Deadlocks halting automated systems cause significant financial loss. Scholars use Petri nets to find all the states (by the state tree) are able to identify the cause of deadlocks. State tree can be divided into two areas of good and bad. Once inside the danger zone, it will inevitably evolve towards deadlock area. Deadlock prevention is commonly used methods by adding the controller to prevent the system from entering the danger zone. It has been a hot research to synthesize optimal controllers to be maximally permissive with fewest monitors. Both memory and CPU usage should be as minimal as
possible. At present, all the maximally permissive methods rely on state tree to enumerate all of the states or mixed integer programming (MIP) test. The number of states or iterations grows exponentially with respect to the size of a Petri net. Therefore,
such methods cannot handle large nets. I propose a revolutionary fastest maximally permissive control theory to find all the basic siphons with linear complexity and least number of controllers, and there is no need to construct reachability tree. The
complexity of the policy is no longer exponential. Currently I have developed theories to identify unmarked token patterns of local blockings for an N-compound region consisting N basic siphons.
Furthermore, a method is developed to combine some of these controllers to reduce the number of controllers while achieving maximal permissiveness. I propose to combine these theories to directly find the above final set of controllers based on set of the basic siphons without the need to identify all emptiable siphons and the associated unmarked token patterns to lead to local blockings. This proposal achieves the best in the field and leads us to the leading
academic position. It allows to control large net in real time and online fashion.
行政院國家科學委員會補助專題研究計畫成果報告
以最少顯示器達到最大許可的 Petri 網的一個子類的最快死鎖防止方法
計畫類別：□個別型計畫 □整合型計畫
計畫編號：101-2221-E-004-001-
執行期間： 101 年 8 月 1 日 至 102 年 7 月 30 日
計畫主持人：趙玉
共同主持人：
計畫參與人員：
執行單位：政治大學資管系
中 華 民 國 1 0 2 年 9 月 1 4 日
行政院國家科學委員會專題研究計畫成果報告
以最少顯示器達到最大許可的 Petri 網的一個子類的最快死鎖防止方法
計 畫 編 號 ：NSC 101-2221-E-004-001- 執 行 期 限 ：101 年 8 月 1 日 至 102 年 7 月 31 日 主 持 人：趙玉 政治大學資管系 共 同 主 持 人 ： 計畫參與人員：
一、中文摘要
鎖死停止自動化系統對公司造成重大的財政損失。 學界使用派翠網路把所有狀態找出(由狀 態樹)便能找出死鎖原因。狀態樹可分為好和壞兩區域，壞區域又可分為危險和死鎖區。一旦 進入危險區，便無可避免地走向死鎖區。死鎖防治是目前普遍採用方法，加控制器以防止系 統進入危險區。主要是防治首次會見壞標記（First-met Bad Marking, FBM）的發生，以減 少控制器數目。最大許可和使用最少監控的最佳合成控制器一直是一個熱門的課題。同時記 憶體及CPU 的使用量也要越少越好。目前所有最大許可的死鎖防止方法都須依靠狀態樹來列 舉所有的狀態或混合整數規劃（MIP）測試。這隨著派翠網路大小迅速(稱為指數型態)往上爆 升而超過電腦所能承擔。因此此類方法無法處理大型網路。其他方法亦有類似問題。本人提 議革命性的控制理論以線性複雜度找出所有基本虹吸，進而以最少的控制器達到最大允許狀 態，且能避免電腦難以處理的指數型態(避免狀態樹建立) 。目前本人已發展理論，找出由N 個基本虹吸複合成區域死鎖所有標記 (Marking) 狀態。從而據此加入控制器。進一步，結合 數個控制器，以減少控制器，並達到最大允許狀態。本人提議結合上述理論，直接由N 個基 本虹吸複合推導出最少控制器最大允許，而無須找出死鎖所有標記及結合數個控制器之部驟。 這項建議達到最佳，並導致我們在該領域領先的學術地位。它可以控制實時和在線時的大型 網路。 關鍵詞: 派翠網，信標可控性，FMS，S3PR，死鎖，控制。Abstract
Deadlocks halting automated systems cause significant financial loss. Scholars use Petri nets to find all the states (by the state tree) are able to identify the cause of deadlocks. State tree can be divided into two areas of good and bad. Once inside the danger zone, it will inevitably evolve towards deadlock area. Deadlock prevention is commonly used methods by adding the controller to prevent the system from entering the danger zone. It has been a hot research to synthesize optimal controllers to be maximally permissive with fewest monitors. Both memory and CPU usage should be as minimal as possible. At present, all the maximally permissive methods rely on state tree to enumerate all of the states or mixed integer programming (MIP) test. The number of states or iterations grows exponentially with respect to the size of a Petri net. Therefore, such methods cannot handle large nets. I propose a revolutionary fastest maximally permissive control theory to find all the basic siphons with linear complexity and least number of controllers, and there is no need to construct reachability
tree. The complexity of the policy is no longer exponential. Currently I have developed theories to identify unmarked token patterns of local blockings for an N-compound region consisting N basic siphons. Furthermore, a method is developed to combine some of these controllers to reduce the number of controllers while achieving maximal permissiveness. I propose to combine these theories to directly find the above final set of controllers based on set of the basic siphons without the need to identify all emptiable siphons and the associated unmarked token patterns to lead to local blockings. This proposal achieves the best in the field and leads us to the leading academic position. It allows to control large net in real time and online fashion.
Key Words: Petri nets, deadlock, control, siphon, optimization
二、緣由與目的
Recently, maximally permissive control policies [8–10, 13, 17–20, 24] rely on reachability analysis and suffer from the state explosion problem. Chen et al. [8–10] develop a novel method that can definitely find an optimal supervisor by adding monitors if such a supervisor exists. This method aims to block the uncontrolled system from entering into the deadlock-zone by preventing all the first met Bad Marking (FBM) from being reached. Moreover, they formulate a method to ensure that all legal markings can be reached in the controlled system and a technique to reduce the computation burden by considering only a minimal covering set of legal markings and a minimal covered set of FBM via a vector covering approach.
The work in [9] suffers from the structural complexity problem since the number of the computed control places is not minimal. In [8], they propose an approach that can obtain a
maximally permissive liveness enforcing supervisor with the minimal number of control places. It is a non-iterative approach since all control places can be once obtained by solving an Integer Linear Programming Problem (ILPP), denoted as MCPP in [8]). Though this approach overcomes the problems of both behavior permissiveness and structural complexity, it still suffers from expensive computational cost. The work in [10] employs a small (not minimal) number of monitors but more efficient than [8] by overcoming the computational complexity problem in [8].
They reduce the number of monitors by solving an ILPP at each iteration, when a Place
Invariant (PI) for a control place is constructed to forbid FBMs as many as possible and to allow the reachability of all markings in the minimal covering set of legal markings. This is achieved by maximizing the number of FBMs forbidden by the PI via the objective function of the ILPP. By removing the forbidden FBMs from the minimal covered set of FBMs, this process is repeated until all FBMs are forbidden. These contributions, though correct and sound, are however far from being the cutting- edge of the literature, given that a better ILP model (plus more or less the same greedy heuristic) has been proposed in [17]. This model has a number of constraints which is linear with respect to the number of states, as opposed to the quadratic one required by the model in [8]. If the quadratic model were tighter than the linear one, that would compensate for its larger size.
However, the experimental results which can be obtained implementing both models on an ILP solver and comparing their performance on benchmark instances, point towards a negative answer. What’s more, the ILP models commonly adopted in the literature have theoretical weaknesses,
discussed in [21], where it is shown how several large benchmark instances can be solved in a matter of seconds to guaranteed optimality by an ad hoc exact algorithm, whereas an ILP solver requires hours, and often must be terminated without achieving an optimality guarantee. Not to mention the recent extension of this theory to more complex supervisory control structures presented in [18]. All these approaches require reachability analysis and some computation to compute critial live and forbidden markings.
The work in [3, 25] avoids reachability analysis but cannot guarantee no loss of live states and employs more monitors than that by Chen et al. [10]. Based on these results, we proposed earlier to merge several monitors into a single one while not losing the live states. For all the examples in [10], we were able to achieve maximal premissiveness with the same number of monitors, but with simpler structures. Most importantly, no reachability analysis is required.
This method categorizes emptiable siphons into basic, compound, control and other types of siphons. Basic (resp. compound) siphons can be synthesized from elementary (resp. compound) resource circuits (i.e., containing only resource places).
Our approach has been recognized as more advantageous than that by Piroddi et al. by avoiding reachability analysis and enumeration of all minimal siphons. It improves the siphon-based approach to reach most states while using fewer monitors. Siphon-based deadlock control of Flexible Manufacturing System (FMS) avoids reachability analysis and hence runs faster than other methods. But it suffers from reaching fewer states than an optimal. FBM (First-met Bad Marking) method requires more monitors than necessary, but reaches more states by refining the monitor for a problematic siphon into several with smaller controller regions since the controller region is less disturbed. However, the same refinement leads to several monitors for the same siphon for some other siphons. These monitors can be combined into one without losing states.
We develop the formal theory to uncover the secret behind the above discrepancy, where we optimize the number of monitors (good states as well) by adding monitors in the normal sequence of basic, compound, control, partial and full mixture siphons. Also, among all 2-dependent siphons (depending on two elementary siphons), only one siphon needs to be controlled by adding a monitor and OC (ordinary control) places; WC (weighted control) places are associated with resource and mixture siphons, respectively; and identify the condition and examples for a WC places to be redundant. This greatly simplifies the synthesis as well as minimizes the number of monitors required while making the control net maximally permissive. We [29] further propose to extend the result to n-dependent siphons with n>2. We develop theory to 1) show that for among all siphons derived from an n-dependent siphon, similar to a 2-dependent, also only one siphon needs to be controlled by adding a monitor. 2) Also such a siphon is identified.
However, the above critical siphon method requires to synthesize all emptiable siphons. It is desirable to synthesize a most permissive and economical controller without constructing RG and enumerating siphons. At present, all the maximally permissive methods either rely on state tree to enumerate all of the states or mixed integer programming (MIP) test. The number of states or iterations grows exponentially with respect to the size of a Petri net. Therefore, such methods cannot handle large nets.
We propose a revolutionary fastest maximally permissive control theory to find all the basic siphons with linear complexity and least number of controllers, and there is no need to construct reachability tree. The complexity of the policy is no longer exponential. Currently we [27] have developed theories to identify unmarked token patterns of local blockings for an N-compound region consisting N basic siphons. Furthermore, a method [26] is developed to combine some of these controllers to reduce the number of controllers while achieving maximal permissiveness.
We propose to combine these theories to directly find the above final set of controllers based on set of the basic siphons without the need to identify all emptiable siphons and the associated unmarked token patterns to lead to local blockings.
We propose [26] a method to merge several monitors into a single one while not losing states. It achieves the same best results in the literature while avoiding the time-consuming reachability analysis which does not scale well with the size of the nets.
三、Results
At present, all the maximally permissive methods either rely on state tree to enumerate all of the states or mixed integer programming (MIP) test. The number of states or iterations grows exponentially with respect to the size of a Petri net. Therefore, such methods cannot handle large nets.
We have illustrated a simple method to synthesize supervisors for very large or infinite k-th order system (all shared resource places carry initially one token and shared between two processes) which overcome the state explosion problem involved in the reachability analysis. Our method first identifies all critical siphons (inferring from patterns M of unmarked siphons and the derived markings necessarily evolving into M) and the associated monitors. Second, we merge as many monitors as possible without losing any legal state. For k-th order systems, this amounts to solving a set of linear equation. The time complexity is linear to the basic circuits (or elementary circuits containing only resource places), much faster than the exponential time for solving integer linear programming problems. This is the first reported close-form solution of an infinite system.
We [29] further extend the closed-form solutions to the control of a slightly more complex infinite system called k2-th order systems (where 2-unit resources are shared between two simple systems). We have written a paper to generalize to kq-th order systems (where q-unit resources are shared between two simple systems). However, we found that for q>2, merging of monitors is no longer possible. We have further develop formulas that involve non-sharing resource places as well as the case where resource places shared among more than two processes.
四、參考文獻
[1] D. Y. Chao, “Computation of elementary siphons in Petri nets for deadlock control,” Comp. J., (British Computer Society), vol. 49, no. 4, pp. 470–479, 2006.
[2] D. Y. Chao, “An incremental approach to extract minimal bad siphons,” Journal of Information Science and Engineering, vol. 23, no. 1, pp. 203-214, Jan. 2007.
[3] D. Y. Chao, “Improvement of suboptimal siphon- and FBM-based control model of a well-known S3PR,” IEEE Transactions on Automation Science and Engineering, vol. 8, no. 2, pp. 404-411, 2011.
[4] D. Y. Chao, “Formal theory of state loss of siphon-based deadlock prevention,” IET Control Theory & Application, vol. 5, no. 2, pp. 1013-1021, 2011.
14
[5] Chao, D.Y., ”Enumeration of lost states of a suboptimal control model of a well- known S3PR,” IET Control Theory & Applications, vol. 5, no. 11, pp. 1277–1286, 2011.
[6] Shouguang Wang and D. Y. Chao, “A Control Policy for γ-Nets without Reachability Analysis and Siphon Enumeration,” technical report, Taiwan Chengchi Univeristy, 2012.
[7] D. Y. Chao, “On the Lower Bounds of Monitor Solutions of Maximally Permissive Supervisors for A Subclass α-S3PR of Flexible Manufacturing Systems,” 2nd review, good comments,
International Journal of System Science, 2011.
[8] Y. F. Chen and Z. W. Li. “Design of a maximally permissive liveness-enforcing su- pervisor with compressed supervisory structure for flexible manufacturing systems,” Automatica, vol. 47, no. 5, pp. 1028-1034.
[9] Y. F. Chen, Z. W. Li, M. Khalgui, and O. Moshabi. “Design of maximally permis- sive liveness-enforcing petri net supervisor for flexible manufacturing systems,” IEEE Trans. on Automation Science and Engineering, vol. 8, no. 2, pp. 374–393, 2011.
[10] Y. F. Chen, Z. W. Li, and M. C. Zhou, “Behavior Optimal and Structural Simple liveness-enforcing supervisor for flexible manufacturing systems,” IEEE Transactions on Systems, Man, and Cybernetics, Part A, DOI:10.1109/TSMCA.2011.2169956, Dec. 2011.
[11] J. Ezpeleta, J. M. Colom, and J. Martinez, “A Petri net based deadlock preven- tion policy for flexible manufacturing systems,” IEEE Transactions on Robotics and Automation, vol. 11, no. 2, pp. 173–184, 1995.
[12] Gaiyun Liu, Daniel Yuh Chao, and Murat Uzam, ”A Merging Method for the Siphon- Based FMS Maximally Permissive Controllers with Simpler Structures,” 2nd review, good comments, IMA Journal of Mathematical Control and Information.
[13] Z. W. Li, M. C. Zhou, and M. D. Jeng, “A maximally permissive deadlock prevention policy for FMS based on Petri net siphon control and the theory of regions,” IEEE Transactions on Automation Science and Engineering, vol. 5, no. 1, pp. 182–188, 2008.
[14] Z. W. Li, J. Zhang, and M. Zhao, “Liveness-enforcing Supervisor Design for a Class of Generalized Petri Net Models of Flexible Manufacturing Systems,” IEE Proceedings Control Theory & Applications, vol. 1, no. 4, pp. 955–967, 2007.
[15] Z. W. Li and M. C. Zhou, “On Controllability of Dependent Siphons for Deadlock Prevention in Generalized Petri Nets,” IEEE Trans. Syst., Man, Cybern., A., vol. 38, no. 2, pp. 369–384, 2008. [16] D. Liu, Z. W. Li, and M. C. Zhou, “Liveness of an Extended S3PR,” Automatica, vol. 46, no. 6, pp. 1008–1018, 2010.
[17] A. Nazeem, S. Reveliotis, Y. Wang, and S. Lafortune, ”Designing Compact and Max- imally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Sys- tems through Classification Theory: The Linear Case”, IEEE Trans. Autom. Control, vol. 56, no. 8, pp. 1818-1833, 2011.
[18] A. Nazeem and S. Reveliotis, ”Designing Compact and Maximally Permissive Dead- lock Avoidance Policies for Complex Resource Allocation Systems Through Classifi- cation Theory: The Nonlinear Case,” IEEE Transactions on Automated Control vol. 57, no. 7, pp. 1670-1684, 2012. [19] L. Piroddi, R. Cordone, and I. Fumagalli, “Combined Siphon and Marking Generation for Deadlock Prevention in Petri Nets,” IEEE Transactions on Systems, Man and Cybernetics - Part A, vol. 39, no. 3, pp. 650-661, May 2009.
[20] L. Piroddi, R. Cordone, and I. Fumagalli, “Selective siphon control for deadlock prevention in Petri nets,” IEEE Transactions on Systems, Man, and Cybernetics, Part A, vol. 38, no. 6, pp. 1337– 1348, 2008.
[21] R. Cordone abd L. Piroddi, ”Parsimonious Monitor Control of Petri Net Models of Flexible Manufacturing Systems,” IEEE Transactions on Systems, Man and Cyber- netics, Part A: Systems and Humans, in press.
[22] M. Uzam and M. C. Zhou, “An iterative synthesis approach to Petri net based dead- lock prevention policy for flexible manufacturing systems,” IEEE Transactions on Systems, Man, and Cybernetics, Part A, vol. 37, no. 3, pp. 362–371, 2007.
[23] M. Uzam and M. C. Zhou, “An improved iterative syhthesis method for liveness enforcing supervisors of flexible manufacturing systems,” International Journal of Production Research, vol. 44, no. 10, pp. 1987–2030, 2006.
[24] M. Uzam, “An optimal deadlock prevention policy for flexible manufacturing systems using Petri net models with resources and the theory of regions,” International Journal of Advanced Manufacturing Technology, vol. 19, no. 3, pp. 192–208, 2002.
[25] Y. Y. Shih and D. Y. Chao “Sequence of control in S3PMR,” Computer Journal, vol.53, no.10, pp. 1691-1703, 2010.
[26] GaiYun Liu, Daniel Yuh Chao, and Murat Uzam, “A Merging Method for the Siphon-Based FMS Maximally Permissive Controllers with Simpler Structures,” IMA Journal of Mathematical Control and Information. (Accepted).
[27] Gai Yun Liu, Daniel Yuh Chao, and Fang Yu, “Control policy for a subclass of Petri nets without reachability analysis,” IET Control Theory and Applications, (Accepted).
[28] Daniel Yuh Chao. A Critical-siphon Approach to Fastest Deadlock Controller for S3PR. Formal Methods in Manufacturing Systems: Recent Advances (ISBN: to appear). Pennsylvania (USA), IGI Global. May, 2013.
[29] Daniel Yuh Chao, T. H. Yu (2013, Jun). A Best Method to Synthesize Very Large K-th Order Systems without Reachability Analysis. International Conference on Software Engineering and Knowledge Engineering, Boston, MA.
①
出國報告（出國類別：國際會議）
②
出席 2013
25th International Conference on
Software Engineering and Knowledge
Engineering 國際會議報告
③
服務機關：政治大學資訊管理
姓名職稱：趙玉教授
派赴國家：美國
出國期間：2013/06/17-2013/09/18
報告日期：2013/09/23
：
封 面 樣 式
國科會 102 年專題計畫
出國成果報告書
計畫編號
1執行單位
2資訊管理
出國人員
趙玉
出國日期
2013 年 6 月 17 日至 2013 年 9 月 18 日 ， 共 日出國地點
3 Boston MA出國經費
4 80000本報告描述本人出席2013 25th International Conference on Software Engineering and Knowledge Engineering國際會議報告國際會議過程、感想及建議。6月17日本 人搭機到Los Angeles。6月26日本人搭機(JetBlue Airline)由Long Beach到麻州波士 頓。本人發表報告一篇論文 “A Best Method to Synthesize Very Large K-th Order Systems without Reachability Analysis。6月29日會議結束。本人搭機(JetBlue Airline)返回Los Angeles。9月17日本人搭機(華航)由Los Angeles返回台北。本人 會議主要為軟體工程教研人員。參加此次會議ˋ可一覽國內外最新研究驅勢。
本報告描述本人出席2013 25th International Conference on Software Engineering and Knowledge Engineering國際會議報告國際會議過程、感想及建議。6月17日本 人搭機到Los Angeles。6月26日本人搭機(JetBlue Airline)由Long Beach到麻州波士 頓。本人發表報告一篇論文 “A Best Method to Synthesize Very Large K-th Order Systems without Reachability Analysis。
論文摘要如下:
Lately, a revolutionary method to synthesize maximally permissive with fewest monitors has emerged. It relies on reachability analysis to find minimal sets of legal and forbidden markings. A number of linear constraints are constructed to forbid all forbidden markings in the set, while guaranteeing all legal markings reachable by solving an integer linear programming problem (ILPP). Due to the state explosion problem, it cannot handle very large systems. We propose earlier a method without reachability analysis and minimal siphon extraction; hence it is scalable to large systems. This paper illustrates such by applying the method to very large k-th order systems with parameter k.
會議
TOPICS
如下:Agent architectures, ontologies, languages and protocols 1 單位出國案如有 1 案以上，計畫編號請以頂大計畫辦公室核給之單位計畫編號 + 「-XX（單位自編 2 位出國案序號）」型式為之。如僅有 1 案，則以頂大計畫單位編號為之即可（出國人員免填）。 2 執行單位係指頂大計畫單位編號對應之單位。 3 出國地點請寫前往之國家之大學、機關組織或會議名稱。 4 出國經費指的是實際核銷金額，單位以元計。
Multi-agent systems
Agent-based learning and knowledge discovery Interface agents
Agent-based auctions and marketplaces Artificial life and societies
Secure mobile and multi-agent systems Mobile agents
Mobile Commerce Technology and Application Systems Mobile Systems
Autonomic computing Adaptive Systems
Integrity, Security, and Fault Tolerance Reliability
Enterprise Software, Middleware, and Tools Process and Workflow Management
E-Commerce Solutions and Applications Industry System Experience and Report
Service-centric software engineering Service oriented requirements engineering Service oriented architectures
Middleware for service based systems Service discovery and composition Quality of services
Service level agreements (drafting, negotiation, monitoring and management)
Runtime service management Semantic web
Requirements Engineering
Agent-based software engineering
Artificial Intelligence Approaches to Software Engineering Component-Based Software Engineering
Automated Software Specification
Automated Software Design and Synthesis Computer-Supported Cooperative Work
Measurement and Empirical Software Engineering Reverse Engineering
Programming Languages and Software Engineering Patterns and Frameworks
Reflection and Metadata Approaches Program Understanding
Knowledge Acquisition
Knowledge-Based and Expert Systems Knowledge Representation and Retrieval Knowledge Engineering Tools and Techniques Time and Knowledge Management Tools Knowledge Visualization
Data visualization
Uncertainty Knowledge Management Ontologies and Methodologies Learning Software Organization Tutoring, Documentation Systems Human-Computer Interaction
Multimedia Applications, Frameworks, and Systems Multimedia and Hypermedia Software Engineering
Smart Spaces Pervasive Computing Swarm intelligence Soft Computing Software Architecture Software Assurance
Software Domain Modeling and Meta-Modeling Software dependability
Software economics
Software Engineering Decision Support Software Engineering Tools and Environments Software Maintenance and Evolution
Software Process Modeling Software product lines Software Quality
Software Reuse Software Safety Software Security
Software Engineering Case Study and Experience Reports
Web and text mining
Web-Based Tools, Applications and Environment Web-Based Knowledge Management
Web-Based Tools, Systems, and Environments Web and Data Mining
08:00 - 08:10 June 27 Thursday Welcome (Grand Ballroom)
Shi-Kuo Chang, Du Zhang, Swapna Gokhale 08:10 - 09:00 June 27 Thursday
Keynote I (Grand Ballroom) (Chair: Shi-Kuo Chang)
Surprising discoveries from emotion sensors Professor Rosalind W. Picard
09:20 - 10:35 June 27 Thursday Software Security
(Chair: Weifeng Zhang)
Runtime Values Driven by Access Control Policies - Statically Enforced at the Level of Relational Business Tiers
Ó scar Mortágua Pereira, Rui L. Aguiar, Maribel Yasmina Santos Exploring Architectural Design Decision Management Paradigms for Global Software Development
Meiru Che, Dewayne E. Perry
A Semantic-based Semi-automated Role Mapping Mechanism (S) Lijuan Diao, Wei She, I-Ling Yen, Junzhong Gu
(Chair: Haiping Xu)
Dynamic Adaptation of Cloud Computing Applications
André Almeida, Everton Cavalcante, Thais Batista, Nélio Cacho, Frederico Lopes, Flavia Delicato, Paulo Pires
A Machine Learning Based File Archival Tool (S) Robert Carreras, Du Zhang, Jinsong Ouyang ---
Mining Features from the Object-Oriented Source Code of a Collection of Software Variants Using Formal Concept Analysis and Latent
Semantic Indexing
R. AL-msie'deen, A.-D. Seriai, M. Huchard, C. Urtado, S. Vauttier, H. Eyal Salman
Model-Driven Generation of Context-Specific Feature Models Thibaut Possompès, Christophe Dony, Marianne Huchard, Chouki Tibermacine
Patterns and Frameworks (Chair: Kehan Gao)
Pattern-based Decentralization and Run-time Adaptation Framework for Multi-site Workflow Orchestrations *
Selim Kalayci, S. Masoud Sadjadi Framework for digital voting systems (S)
Patricia Dousseau Cabral, Ricardo Pereira e Silva, Roberto Silvino da Cunha
How do You Execute Reuse Tasks Among Tools?
Fábio P. Basso, Cláudia M. L. Werner, Raquel M. Pillat, Toacy C. Oliveira
Using Prolog Rules to Detect Software Design Patterns: Strengths and Weaknesses (S)
Hamdi A. Al-Jamimi, Moataz Ahmed 15:00 - 15:20 June 29 Saturday
Closing Ceremony (Grand Ballroom) Shi-Kuo Chang, Du Zhang, Swapna Gokhale
本人論文發表於6月27日星期二。Session title 及議程如下 Petri Nets
(Chair: Daniel Yuh Chao)
A Petri Net Model Specification for Delivering Adaptable Ads through Digital Signage in Pervasive Environments
Frederico M. Bublitz, Lenardo C. e Silva, Elthon A. da S. Oliveira, Saulo O. D. Luiz, Hyggo O. de Almeida, Angelo Perkusich
An Approach for Analyzing Software Specifications in Petri Nets Junhua Ding, Dianxiang Xu, Jidong Ge
A Best Method to Synthesize Very Large K-th Order Systems without Reachability Analysis (S)
Daniel Yuh Chao & T. H. Yu
6 月 29 日會議結束。本人搭機(JetBlue Airline)返回 Los Angeles。9 月 17 日本人 搭機(華航)由 Los Angeles 返回台北。本人會議主要為軟體工程教研人員。參加 此次會議ˋ可一覽國內外最新研究驅勢。本人論文發表於
７月 27 日星期
。 Session title 及議程如上 採行之建議事項：更行出國經費流程簡化以減輕教授支負擔
或訓練專人處理以增加效率 所需經費由所有教授支應 出國人簽名： 日期： 連絡人： 分機： 出國報告審核表 出國報告名稱：出國人姓名（2 人以上，以 1 人為 代表） 職稱 服務單位
趙玉
資訊管理
出國類別 考察 進修 研究 實習 其他 2013 ＳＥＫＥ （例如國際會議、國際比賽、業務接洽 等） 出國期間： 年 月 日至 年 月 日 報告繳交日期： 年 月 日 計 畫 主 辦 機 關 審 核 意 見 1.依限繳交出國報告 2.格式完整（本文必須具備「目的」、「過程」、「心得及建議事項」） 3.無抄襲相關出國報告 4.內容充實完備 5.建議具參考價值 6.送本機關參考或研辦 7.送上級機關參考 8.退回補正，原因：不符原核定出國計畫 以外文撰寫或僅以所蒐集外文資料為內容 內容空洞簡略或未涵蓋規定要項 抄襲相關出國報告之全部或部分內容 電子檔案未 依格式辦理 未於資訊網登錄提要資料及傳送出國報告電子檔 9.本報告除上傳至出國報告資訊網外，將採行之公開發表： 辦理本機關出國報告座談會（說明會），與同仁進行知識分享。 於本機關業務會報提出報告 其他 10.其他處理意見及方式： 審核 人 一級單位主管 機關首長或其授權人員 說明： 一、 各機關可依需要自行增列審核項目內容，出國報告審核完畢本表請自行保存。 二、 審核作業應儘速完成，以不影響出國人員上傳出國報告至「政府出版資料回應網公務出國報告 專區」為原則。 三、 出國人員免填灰色部份。國科會補助計畫衍生研發成果推廣資料表
日期:2013/09/24國科會補助計畫
計畫名稱: 以最少顯示器達到最大許可的Petri網的一個子類的最快死鎖防止方法 計畫主持人: 趙玉 計畫編號: 101-2221-E-004-001- 學門領域: 資訊技術及系統整合無研發成果推廣資料
101 年度專題研究計畫研究成果彙整表
計畫主持人：趙玉 計畫編號： 101-2221-E-004-001-計畫名稱：以最少顯示器達到最大許可的 Petri 網的一個子類的最快死鎖防止方法 量化 成果項目 實際已達成 數（被接受 或已發表） 預期總達成 數(含實際已 達成數) 本計畫實 際貢獻百 分比 單位 備 註 （ 質 化 說 明：如 數 個 計 畫 共 同 成 果、成 果 列 為 該 期 刊 之 封 面 故 事 ... 等） 期刊論文 0 0 100% 研究報告/技術報告 0 0 100% 研討會論文 0 0 100% 篇 論文著作 專書 0 0 100% 申請中件數 0 0 100% 專利 已獲得件數 0 0 100% 件 件數 0 0 100% 件 技術移轉 權利金 0 0 100% 千元 碩士生 0 0 100% 博士生 0 0 100% 博士後研究員 0 0 100% 國內 參與計畫人力 （本國籍） 專任助理 0 0 100% 人次 期刊論文 7 0 100% 研究報告/技術報告 0 0 100% 研討會論文 3 0 100% 篇 論文著作 專書 0 0 100% 章/本 申請中件數 0 0 100% 專利 已獲得件數 0 0 100% 件 件數 0 0 100% 件 技術移轉 權利金 0 0 100% 千元 碩士生 0 0 100% 博士生 0 0 100% 博士後研究員 0 0 100% 國外 參與計畫人力 （外國籍） 專任助理 0 0 100% 人次其他成果
