Logic Petri nets （LPNs） are suitable to describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. To investigate the dynamic properties of LPNs directly, a new method fo...Logic Petri nets （LPNs） are suitable to describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. To investigate the dynamic properties of LPNs directly, a new method for analyzing LPNs is proposed based on marking reachability graphs in this paper. Enabled conditions of transitions are obtained and a marking reachability graph is constructed. All reach- able markings can be obtained based on the graph; the fairness and reversibility of LPNs are analyzed. Moreover, the computing complexity of the enabled conditions and reachable markings can be reduced by this method. The advantages of the proposed method are illustrated by examples and analysis.展开更多
In this paper, a fuzzy Petri net approach to modelling fuzzy rule-based reasoning is proposed. Logical Petri net (LPN) and fuzzy logical Petri net (FLPN) are defined. The backward reasoning algorithm based on sub-fuzz...In this paper, a fuzzy Petri net approach to modelling fuzzy rule-based reasoning is proposed. Logical Petri net (LPN) and fuzzy logical Petri net (FLPN) are defined. The backward reasoning algorithm based on sub-fuzzy logical Petri net is given. It is simpler than the conventional algorithm of forward reasoning from initial propositions. An application to the partial fault model of a car engine in paper Portinale's(1993) is used as an illustrative example of FLPN.展开更多
The soundness is a very important criterion for the correctness of the workflow. Specifying the soundness with Computation Tree Logic （CTL） allows us to verify the soundness with symbolic model checkers. Therefore t...The soundness is a very important criterion for the correctness of the workflow. Specifying the soundness with Computation Tree Logic （CTL） allows us to verify the soundness with symbolic model checkers. Therefore the state explosion problem in verifying soundness can be overcome efficiently. When the property is not satisfied by the system, model checking can give a counter-example, which can guide us to correct the workflow. In addition, relaxed soundness is another important criterion for the workflow. We also prove that Computation Tree Logic ＊ （CTL ＊ ） can be used to character the relaxed soundness of the workflow.展开更多
A method to model and analyze the hybrid systems is presented. The time to be considered in the plant is taken as an explicit parameter through the constrained predicated net (CPN). The CPN's basic structure is a ...A method to model and analyze the hybrid systems is presented. The time to be considered in the plant is taken as an explicit parameter through the constrained predicated net (CPN). The CPN's basic structure is a Petri net with predicated transition. All components of the net are expressed by annotation which is defined on rational set Q. The analysis method for the plant is interval temporal logic represented by Petri nets. This paper combines the above two methods to synthesize the hybrid system, gives a simple and clear expression of the expected action of the studied plant.展开更多
Reachability-based analysis and temporal analysis are used to verify the properties of concurrent systems, and it is important to exploit fast and efficient methods. This paper gives semantics of temporal formulae wit...Reachability-based analysis and temporal analysis are used to verify the properties of concurrent systems, and it is important to exploit fast and efficient methods. This paper gives semantics of temporal formulae with edges of the transition system of Petri net, and then presents a fast temporal analyzing method, which takes advantage of both Petri net and temporal logic. The method only expands a path of equivalence trace while the path does not satisfy a property according to trace semantics of Petri net, and can validate directly the property on Petri net. Moreover, we exploit a minimal degree of in-out of a node as heuristics to select a path of an equivalence trace. Finally, we demonstrate the validity of the method that decreases state spaces and improves the verification system with the experimental results.展开更多
基金This work is supported by the National Basic Research Program of China （2010CB328101） the National Natural Science Foundation of China （Grant Nos. 61170078 and 61173042）+2 种基金 the Doctoral Program of Higher Education of the Specialized Research Fund of China （20113718110004） Basic Research Program of Qingdao City of China （13- 1-4-116-jch） and the SDUST Research Fund of China （2011KYTD 102）.
文摘Logic Petri nets （LPNs） are suitable to describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. To investigate the dynamic properties of LPNs directly, a new method for analyzing LPNs is proposed based on marking reachability graphs in this paper. Enabled conditions of transitions are obtained and a marking reachability graph is constructed. All reach- able markings can be obtained based on the graph; the fairness and reversibility of LPNs are analyzed. Moreover, the computing complexity of the enabled conditions and reachable markings can be reduced by this method. The advantages of the proposed method are illustrated by examples and analysis.
基金Supported by the National Natural Science Foundation of China, Excellent Ph.D Paper Author Foundation of China, Dawn Plan Foundation of Shanghai and Excellent Young Scientist Foundation of Shandong Province
文摘In this paper, a fuzzy Petri net approach to modelling fuzzy rule-based reasoning is proposed. Logical Petri net (LPN) and fuzzy logical Petri net (FLPN) are defined. The backward reasoning algorithm based on sub-fuzzy logical Petri net is given. It is simpler than the conventional algorithm of forward reasoning from initial propositions. An application to the partial fault model of a car engine in paper Portinale's(1993) is used as an illustrative example of FLPN.
基金Supported by the National Natural Science Foun-dation of China (60573046)
文摘The soundness is a very important criterion for the correctness of the workflow. Specifying the soundness with Computation Tree Logic （CTL） allows us to verify the soundness with symbolic model checkers. Therefore the state explosion problem in verifying soundness can be overcome efficiently. When the property is not satisfied by the system, model checking can give a counter-example, which can guide us to correct the workflow. In addition, relaxed soundness is another important criterion for the workflow. We also prove that Computation Tree Logic ＊ （CTL ＊ ） can be used to character the relaxed soundness of the workflow.
文摘A method to model and analyze the hybrid systems is presented. The time to be considered in the plant is taken as an explicit parameter through the constrained predicated net (CPN). The CPN's basic structure is a Petri net with predicated transition. All components of the net are expressed by annotation which is defined on rational set Q. The analysis method for the plant is interval temporal logic represented by Petri nets. This paper combines the above two methods to synthesize the hybrid system, gives a simple and clear expression of the expected action of the studied plant.
文摘Reachability-based analysis and temporal analysis are used to verify the properties of concurrent systems, and it is important to exploit fast and efficient methods. This paper gives semantics of temporal formulae with edges of the transition system of Petri net, and then presents a fast temporal analyzing method, which takes advantage of both Petri net and temporal logic. The method only expands a path of equivalence trace while the path does not satisfy a property according to trace semantics of Petri net, and can validate directly the property on Petri net. Moreover, we exploit a minimal degree of in-out of a node as heuristics to select a path of an equivalence trace. Finally, we demonstrate the validity of the method that decreases state spaces and improves the verification system with the experimental results.
