he logical tree methods are used for evaluate quantitatively relationship between frequency and magnitude, and deduce uncertainties of annual occurrence rate of earthquakes in the periods of lower magnitude earthquake...he logical tree methods are used for evaluate quantitatively relationship between frequency and magnitude, and deduce uncertainties of annual occurrence rate of earthquakes in the periods of lower magnitude earthquake. The uncertainties include deviations from the self-similarity of frequency-magnitude relations, different fitting methods, different methods obtained the annual occurrence rate, magnitude step used in fitting, start magnitude, error of magnitude and so on. Taking Xianshuihe River source zone as an example, we analyze uncertainties of occurrence rate of earthquakes M4, which is needed in risk evaluation extrapolating from frequency-magnitude relations of stronger earthquakes. The annual occurrence rate of M4 is usually required for seismic hazard assessment.The sensitivity analysis and examinations indicate that, in the same frequencymagnitude relations fitting method, the most sensitive factor is annual occurrence rate, the second is magnitude step and the following is start magnitude. Effect of magnitude error is rather small.Procedure of estimating the uncertainties is as follows:①Establishing a logical tree described uncertainties in frequencymagnitude relations by available data and knowledge about studied region.② Calculating frequencymagnitude relations for each end branches. ③ Examining sensitivities of each uncertainty factors, amending structure of logical tree and adjusting original weights. ④ Recalculating frequencymagnitude relations of end branches and complementary cumulative distribution function (CCDF) in each magnitude intervals.⑤ Obtaining an annual occurrence rate of M4 earthquakes under given fractiles.Taking fractiles as 20% and 80%, annual occurrence rate of M 4 events in Xianshuihe seismic zone is 0.643 0. The annual occurrence rate is 0.631 8 under fractiles of 50%, which is very close to that under fractiles 20% and 80%.展开更多
How to design a multicast key management system with high performance is a hot issue now. This paper will apply the idea of hierarchical data processing to construct a common analytic model based on directed logical k...How to design a multicast key management system with high performance is a hot issue now. This paper will apply the idea of hierarchical data processing to construct a common analytic model based on directed logical key tree and supply two important metrics to this problem： re-keying cost and key storage cost. The paper gives the basic theory to the hierarchical data processing and the analyzing model to multieast key management based on logical key tree. It has been proved that the 4-ray tree has the best performance in using these metrics. The key management problem is also investigated based on user probability model, and gives two evaluating parameters to re-keying and key storage cost.展开更多
Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as s...Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.展开更多
A probabilistic seismic hazard analysis （PSHA） was conducted to establish the hazard spectra for a site located at Dubai Creek on the west coast of the United Arab Emirates （UAE）. The PSHA considered all the seism...A probabilistic seismic hazard analysis （PSHA） was conducted to establish the hazard spectra for a site located at Dubai Creek on the west coast of the United Arab Emirates （UAE）. The PSHA considered all the seismogenic sources that affect the site, including plate boundaries such as the Makran subduction zone, the Zagros fold-thrust region and the transition fault system between them; and local crustal faults in UAE. PSHA indicated that local faults dominate the hazard. The peak ground acceleration （PGA） for the 475-year return period spectrum is 0.17 g and 0.33 g for the 2,475-year return period spectrum. The hazard spectra are then employed to establish rock ground motions using the spectral matching technique.展开更多
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.展开更多
An effective assemble-oriented framework for grid Web service based on open grid service architecture was proposed,in which Web service semantics network constructed by software reuse was designed to enhance the locat...An effective assemble-oriented framework for grid Web service based on open grid service architecture was proposed,in which Web service semantics network constructed by software reuse was designed to enhance the locating of assemble-oriented service resources.The successful Web services assembled structure was exploited to design semantics network,the logical and the physical structure of the resource was separated in Web service,and the logical resource derived from type ID of Web service was combined with semantic structure.The organizing protocol,data structures and the mechanism of implementation in the model were presented.Experiment results show that the success ratio of Web service request comes to 100% while providing completely assembly semantics set.This model provides guarantee of the reliability of assemble Web service and establishes the foundation of Web service automatic interaction,customizing application service and dynamic service configuration.展开更多
Seismic hazard assessment is carried out by utilizing deterministic approach to evaluate the maximum expected earthquake ground motions along the Western Coastal Province of Saudi Arabia. The analysis is accomplished ...Seismic hazard assessment is carried out by utilizing deterministic approach to evaluate the maximum expected earthquake ground motions along the Western Coastal Province of Saudi Arabia. The analysis is accomplished by incorporating seismotectonic source model, determination of earthquake magnitude （Mmax）, set of appropriate ground motion predictive equations （GMPE）, and logic tree sequence. The logic tree sequence is built up to assign weight to ground motion scaling relationships. Contour maps of ground acceleration are generated at different spectral periods. These maps show that the largest ground motion values are emerged in northern and southern regions of the western coastal province in Saudi Arabia in comparison with the central region.展开更多
This study focuses on automatic searching and verifying methods for the teachability, transition logics and hierarchical structure in all possible paths of biological processes using model checking. The automatic sear...This study focuses on automatic searching and verifying methods for the teachability, transition logics and hierarchical structure in all possible paths of biological processes using model checking. The automatic search and verification for alternative paths within complex and large networks in biological process can provide a considerable amount of solutions, which is difficult to handle manually. Model checking is an automatic method for verifying if a circuit or a condition, expressed as a concurrent transition system, satisfies a set of properties expressed in a temporal logic, such as computational tree logic （CTL）. This article represents that model checking is feasible in biochemical network verification and it shows certain advantages over simulation for querying and searching of special behavioral properties in biochemical processes.展开更多
The formal modelling and verification method has become an effective way of improving the reliability and correctness of complex,safety-critical embedded systems.Statecharts are widely used to formally model embedded ...The formal modelling and verification method has become an effective way of improving the reliability and correctness of complex,safety-critical embedded systems.Statecharts are widely used to formally model embedded applications,but they do not realise the reasonable separation of system concerns,which would result in code scattering and tangling.Aspect-Oriented Software Development(AOSD)technology could separate crosscutting concerns from core concerns and identify potential problems in the early phase of the software development life cycle.Therefore,the paper proposes aspect-oriented timed statecharts(extended timed statecharts with AOSD)to separately model base functional requirements and other requirements(e.g.,scheduling,error handling),thereby improving the modularity and development efficiency of embedded systems.Furthermore,the dynamic behaviours of embedded systems are simulated and analysed to determine whether the model satisfies certain properties(e.g.,liveness,safety)described by computation tree logic formulae.Finally,a given case demonstrates some desired properties processed with respect to the aspect-oriented timed statecharts model.展开更多
Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems, In this paper, we introduce recursion into such logic system, which can describe the t...Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems, In this paper, we introduce recursion into such logic system, which can describe the tree data more dearly and concisely. By making a distinction between proposition and predicate, a concise semantics interpretation for our modal logic is given. We also develop a model checking algorithm for the logic without △ operator. The correctness of the algorithm is shown. Such work can be seen as the basis of the semi-structured data processing language and more flexible type system.展开更多
This paper discussed how to handle the fairness conditions in partial Kripke structures. The partial Kripke structures were used for partial state spaces model checking, which is a new technique to solve problems of s...This paper discussed how to handle the fairness conditions in partial Kripke structures. The partial Kripke structures were used for partial state spaces model checking, which is a new technique to solve problems of state explosion. This paper extended the partial Kripke structure with fairness conditions by defining a partial fair Kripke structure, and a 3 valued fair CTL(Computation Tree Logic) semantics correspondingly. It defines a fair preorder between partial Kripke structures that preserves fairness and is akin to fair bisimulation. In addition, a pertinent theorem is also given, which indicates the relationship between the partial state spaces and the more complete one by illustrating the characterizations of states in the partial fair structure in terms of CTL formulae.展开更多
There are many variants of Petri net at present, and some of them can be used to model system with both function and performance specification, such as stochastic Petri net, generalized stochastic Petri net and probab...There are many variants of Petri net at present, and some of them can be used to model system with both function and performance specification, such as stochastic Petri net, generalized stochastic Petri net and probabilistic Petri net. In this paper, we utilize extended Petri net to address the issue of modeling and verifying system with probability and nondeterminism besides function aspects. Using probabilistic Petri net as reference, we propose a new mixed model NPPN （Nondeterministic Probabilistic Petri Net） system, which can model and verify systems with qualitative and quantitative behaviours. Then we develop a kind of process algebra for NPPN system to interpret its algebraic semantics, and an action- based PCTL （Probabilistic Computation Tree Logic） to interpret its logical semantics. Afterwards we present the rules for compositional operation of NPPN system based on NPPN system process algebra, and the model checking algorithm based on the action-based PCTL. In order to put the NPPN system into practice, we develop a friendly and visual tool for modeling, analyzing, simulating, and verifying NPPN system using action-based PCTL. The usefulness and effectiveness of the NPPN system are illustrated by modeling and model checking an elaborate model of travel arrangements workflow.展开更多
文摘he logical tree methods are used for evaluate quantitatively relationship between frequency and magnitude, and deduce uncertainties of annual occurrence rate of earthquakes in the periods of lower magnitude earthquake. The uncertainties include deviations from the self-similarity of frequency-magnitude relations, different fitting methods, different methods obtained the annual occurrence rate, magnitude step used in fitting, start magnitude, error of magnitude and so on. Taking Xianshuihe River source zone as an example, we analyze uncertainties of occurrence rate of earthquakes M4, which is needed in risk evaluation extrapolating from frequency-magnitude relations of stronger earthquakes. The annual occurrence rate of M4 is usually required for seismic hazard assessment.The sensitivity analysis and examinations indicate that, in the same frequencymagnitude relations fitting method, the most sensitive factor is annual occurrence rate, the second is magnitude step and the following is start magnitude. Effect of magnitude error is rather small.Procedure of estimating the uncertainties is as follows:①Establishing a logical tree described uncertainties in frequencymagnitude relations by available data and knowledge about studied region.② Calculating frequencymagnitude relations for each end branches. ③ Examining sensitivities of each uncertainty factors, amending structure of logical tree and adjusting original weights. ④ Recalculating frequencymagnitude relations of end branches and complementary cumulative distribution function (CCDF) in each magnitude intervals.⑤ Obtaining an annual occurrence rate of M4 earthquakes under given fractiles.Taking fractiles as 20% and 80%, annual occurrence rate of M 4 events in Xianshuihe seismic zone is 0.643 0. The annual occurrence rate is 0.631 8 under fractiles of 50%, which is very close to that under fractiles 20% and 80%.
基金Supported by the National High-Technology Re-search and Development Programof China(2001AA115300) the Na-tional Natural Science Foundation of China (69874038) ,the Nat-ural Science Foundation of Liaoning Province(20031018)
文摘How to design a multicast key management system with high performance is a hot issue now. This paper will apply the idea of hierarchical data processing to construct a common analytic model based on directed logical key tree and supply two important metrics to this problem： re-keying cost and key storage cost. The paper gives the basic theory to the hierarchical data processing and the analyzing model to multieast key management based on logical key tree. It has been proved that the 4-ray tree has the best performance in using these metrics. The key management problem is also investigated based on user probability model, and gives two evaluating parameters to re-keying and key storage cost.
基金The work is partially supported by Natural Science Foundation of Ningxia(Grant No.AAC03300)National Natural Science Foundation of China(Grant No.61962001)Graduate Innovation Project of North Minzu University(Grant No.YCX23152).
文摘Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.
文摘A probabilistic seismic hazard analysis （PSHA） was conducted to establish the hazard spectra for a site located at Dubai Creek on the west coast of the United Arab Emirates （UAE）. The PSHA considered all the seismogenic sources that affect the site, including plate boundaries such as the Makran subduction zone, the Zagros fold-thrust region and the transition fault system between them; and local crustal faults in UAE. PSHA indicated that local faults dominate the hazard. The peak ground acceleration （PGA） for the 475-year return period spectrum is 0.17 g and 0.33 g for the 2,475-year return period spectrum. The hazard spectra are then employed to establish rock ground motions using the spectral matching technique.
基金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.
基金Project (60573127) supported by the National Natural Science Foundation of ChinaProject (06023960) supported by the Natural Science Foundation of Guangdong Province, ChinaProject (06JJ30032) supported by the Natural Science Foundation of Hunan Province, China
文摘An effective assemble-oriented framework for grid Web service based on open grid service architecture was proposed,in which Web service semantics network constructed by software reuse was designed to enhance the locating of assemble-oriented service resources.The successful Web services assembled structure was exploited to design semantics network,the logical and the physical structure of the resource was separated in Web service,and the logical resource derived from type ID of Web service was combined with semantic structure.The organizing protocol,data structures and the mechanism of implementation in the model were presented.Experiment results show that the success ratio of Web service request comes to 100% while providing completely assembly semantics set.This model provides guarantee of the reliability of assemble Web service and establishes the foundation of Web service automatic interaction,customizing application service and dynamic service configuration.
基金the support by Deanship of graduate studies and Geophysics Department,at King Abdulaziz University
文摘Seismic hazard assessment is carried out by utilizing deterministic approach to evaluate the maximum expected earthquake ground motions along the Western Coastal Province of Saudi Arabia. The analysis is accomplished by incorporating seismotectonic source model, determination of earthquake magnitude （Mmax）, set of appropriate ground motion predictive equations （GMPE）, and logic tree sequence. The logic tree sequence is built up to assign weight to ground motion scaling relationships. Contour maps of ground acceleration are generated at different spectral periods. These maps show that the largest ground motion values are emerged in northern and southern regions of the western coastal province in Saudi Arabia in comparison with the central region.
文摘This study focuses on automatic searching and verifying methods for the teachability, transition logics and hierarchical structure in all possible paths of biological processes using model checking. The automatic search and verification for alternative paths within complex and large networks in biological process can provide a considerable amount of solutions, which is difficult to handle manually. Model checking is an automatic method for verifying if a circuit or a condition, expressed as a concurrent transition system, satisfies a set of properties expressed in a temporal logic, such as computational tree logic （CTL）. This article represents that model checking is feasible in biochemical network verification and it shows certain advantages over simulation for querying and searching of special behavioral properties in biochemical processes.
基金supported by the National Natural Science Foundation of China under GrantsNo.61173048,No.61103115
文摘The formal modelling and verification method has become an effective way of improving the reliability and correctness of complex,safety-critical embedded systems.Statecharts are widely used to formally model embedded applications,but they do not realise the reasonable separation of system concerns,which would result in code scattering and tangling.Aspect-Oriented Software Development(AOSD)technology could separate crosscutting concerns from core concerns and identify potential problems in the early phase of the software development life cycle.Therefore,the paper proposes aspect-oriented timed statecharts(extended timed statecharts with AOSD)to separately model base functional requirements and other requirements(e.g.,scheduling,error handling),thereby improving the modularity and development efficiency of embedded systems.Furthermore,the dynamic behaviours of embedded systems are simulated and analysed to determine whether the model satisfies certain properties(e.g.,liveness,safety)described by computation tree logic formulae.Finally,a given case demonstrates some desired properties processed with respect to the aspect-oriented timed statecharts model.
基金Supported by the National Natural Sciences Foun-dation of China (60233010 ,60273034 ,60403014) ,863 ProgramofChina (2002AA116010) ,973 Programof China (2002CB312002)
文摘Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems, In this paper, we introduce recursion into such logic system, which can describe the tree data more dearly and concisely. By making a distinction between proposition and predicate, a concise semantics interpretation for our modal logic is given. We also develop a model checking algorithm for the logic without △ operator. The correctness of the algorithm is shown. Such work can be seen as the basis of the semi-structured data processing language and more flexible type system.
基金National Natural Science Foundation of China( No.60 173 10 3 )
文摘This paper discussed how to handle the fairness conditions in partial Kripke structures. The partial Kripke structures were used for partial state spaces model checking, which is a new technique to solve problems of state explosion. This paper extended the partial Kripke structure with fairness conditions by defining a partial fair Kripke structure, and a 3 valued fair CTL(Computation Tree Logic) semantics correspondingly. It defines a fair preorder between partial Kripke structures that preserves fairness and is akin to fair bisimulation. In addition, a pertinent theorem is also given, which indicates the relationship between the partial state spaces and the more complete one by illustrating the characterizations of states in the partial fair structure in terms of CTL formulae.
基金This work was supported by the National Natural Science Foundation of China under Grant Nos. 60970007, 61073050 and 61170044, the National Basic Research 973 Program of China under Grant No. 2007CB310800, the Shanghai Leading Academic Discipline Project of China under Grant No. J50103, and the Natural Science Foundation of Shandong Province of China under Grant No. ZR2012FQ013.
文摘There are many variants of Petri net at present, and some of them can be used to model system with both function and performance specification, such as stochastic Petri net, generalized stochastic Petri net and probabilistic Petri net. In this paper, we utilize extended Petri net to address the issue of modeling and verifying system with probability and nondeterminism besides function aspects. Using probabilistic Petri net as reference, we propose a new mixed model NPPN （Nondeterministic Probabilistic Petri Net） system, which can model and verify systems with qualitative and quantitative behaviours. Then we develop a kind of process algebra for NPPN system to interpret its algebraic semantics, and an action- based PCTL （Probabilistic Computation Tree Logic） to interpret its logical semantics. Afterwards we present the rules for compositional operation of NPPN system based on NPPN system process algebra, and the model checking algorithm based on the action-based PCTL. In order to put the NPPN system into practice, we develop a friendly and visual tool for modeling, analyzing, simulating, and verifying NPPN system using action-based PCTL. The usefulness and effectiveness of the NPPN system are illustrated by modeling and model checking an elaborate model of travel arrangements workflow.
