This paper deals with the synthesis of Petri net supervisor enforcing the more expressive constraints including marking terms, firing vector terms and Parikh vector terms. The method is developed to handle uncontrolla...This paper deals with the synthesis of Petri net supervisor enforcing the more expressive constraints including marking terms, firing vector terms and Parikh vector terms. The method is developed to handle uncontrollable and unobservable transitions existing in the constraints. The “greater-than or equal” general constraints can also be transformed into “less-than or equal” Parikh constraints. An example is analyzed to show how the problem is solved. General constraint is first transformed into Parikh vector constraints, and Matrix-Transformation is proposed to obtain the admissible constraints without uncontrollable and unobservable transitions. Then the supervisor can be constructed based on constraints only consisting of Parikh vector terms. The method is proved to be more concise and effective than the method presented by Iordache and Moody especially when applied to large scale systems.展开更多
The problem of reconstruction of a binary image in the field of discrete tomography is a classic instance of seeking solution applying mathematical techniques. Here two such binary image reconstruction problems are co...The problem of reconstruction of a binary image in the field of discrete tomography is a classic instance of seeking solution applying mathematical techniques. Here two such binary image reconstruction problems are considered given some numerical information on the image. Algorithms are developed for solving these problems and correctness of the algorithms are discussed.展开更多
基金Project supported by the National Natural Science Foundation of China (No. 60504024), Zhejiang Provincial Education Department(No. 20050905), and "151 Talent Project" of Zhejiang Province,China
文摘This paper deals with the synthesis of Petri net supervisor enforcing the more expressive constraints including marking terms, firing vector terms and Parikh vector terms. The method is developed to handle uncontrollable and unobservable transitions existing in the constraints. The “greater-than or equal” general constraints can also be transformed into “less-than or equal” Parikh constraints. An example is analyzed to show how the problem is solved. General constraint is first transformed into Parikh vector constraints, and Matrix-Transformation is proposed to obtain the admissible constraints without uncontrollable and unobservable transitions. Then the supervisor can be constructed based on constraints only consisting of Parikh vector terms. The method is proved to be more concise and effective than the method presented by Iordache and Moody especially when applied to large scale systems.
基金a FRGS grant No.203/PKOMP/6711267an ERGS Grant No.203/PKOMP/6730075 of the Ministry of Higher Education(MoH E),Malaysia
文摘The problem of reconstruction of a binary image in the field of discrete tomography is a classic instance of seeking solution applying mathematical techniques. Here two such binary image reconstruction problems are considered given some numerical information on the image. Algorithms are developed for solving these problems and correctness of the algorithms are discussed.
