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.展开更多
In order to realize distributed computing of Ada95, this paper discusses Ada95's distributed system model and an implement model of Ada95's distributed computing-- workstation cluster model. Under this model,...In order to realize distributed computing of Ada95, this paper discusses Ada95's distributed system model and an implement model of Ada95's distributed computing-- workstation cluster model. Under this model, we presents a pre-allocation strategy for allocating the computation quantity of distributed units evenly among workstations and also reducing the communication expense between those distributed units.展开更多
文摘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.
文摘In order to realize distributed computing of Ada95, this paper discusses Ada95's distributed system model and an implement model of Ada95's distributed computing-- workstation cluster model. Under this model, we presents a pre-allocation strategy for allocating the computation quantity of distributed units evenly among workstations and also reducing the communication expense between those distributed units.
