Dynamic fault tree analysis using inputoutput interactive. A compositional semantics for dynamic fault trees in terms of interactive markov chains. A simple usecase is used through diverse modeling variants, illustrating the capabilities, the. In this chapter, we describe the markov logic representation and give an overview of current inference and learning algorithms for it.
Modeling safety and security interdependencies with bdmp boolean logic driven markov processes. We begin with some background on markov networks and. Optimal control of markov decision processes with linear temporal logic constraints xuchu dennis ding stephen l. This method relies on a modeling formalism called bdmp boolean logic driven markov processes that was initially created for safety studies, and then adapted. Analysing attack trees is more useful when the probabilities for events in the tree are known. Boolean logic driven markov processes, reliability engineering and system safety, vol. Boolean logic driven markov processes researchgate. Investigation of a markov model for computer system. Dynamic security modeling with boolean logic driven markov processes bdmp, proceedings of the 2010 european computing conference, ieee computer society, 2010, pp. Johnson, title using assurance cases and boolean logic driven markov processes to formalize cyber security concerns for safetycritical interaction with global navigation satellite systems, booktitle proceedings of the 4th formal methods for interactive systems workshop 2011, year 2011. In this research the goal is to find methods to use data analysis to find these probabilities. Smart grid reliability assessment utilizing boolean driven. Boolean logic introduction the basic boolean operators are and, or and not.
Modeling markov decision processes with imprecise probabilities using probabilistic logic programming thiago p. The implicit assumptions made by the classical bdmp to describe these mechanisms are first highlighted. Attack and defense modeling with bdmp springerlink. Pdf bdmp boolean logic driven markov processes as an. Evaluation of continuoustime markov processes stewart, 1994 is usually done by translating the markov process. Thus, boolean logic is sometimes used to denote propositional calculus performed in this way. Boolean logic driven markov process how is boolean logic driven markov process abbreviated. Nov 01, 2003 read a new formalism that combines advantages of faulttrees and markov models. Finding the minimal cut sequences of dynamic, repairable. The bdmp boolean logic driven markov processes modeling formalism has recently been adapted from reliability engineering to security modeling. Based on the structure and control logic of pwlcs, the bdmp model. Modeling standby redundancies in repairable systems as guarded. Pdf using bdmp boolean logic driven markov processes. Boolean algebra is not sufficient to capture logic formulas using quantifiers, like those from first order logic.
Combinin g the two has been a longstanding goal of ai research. Using assurance cases and boolean logic driven markov processes to formalise cyber security concerns for safetycritical interaction with global navigation satellite systems. Using assurance cases and boolean logic driven markov processes to formalis e cyber security concerns for safetycritical interaction with global navigation satellite systems chris w. A learning based approach to control synthesis of markov decision processes for linear temporal logic speci.
Markov decision processes mdp represent a class of sequential decisionmaking problems in. Author links open overlay panel marc bouissou a b jeanlouis bon c d. Read a new formalism that combines advantages of faulttrees and markov models. Ascii table 7bit ascii american standard code for information interchange. Also note that in the output xml file, a localmemory type condition basically indicates an and boolean logic operation and hence, the corresponding rlo value is needed to be anded with the rlo value of the other conditions in order to determine the resultant rlo value of the corresponding sub logic block. International audiencethis paper proposes an extension of the bdmp boolean logic driven markov processes formalism for enriching its capabilities to model replacement and resumption mechanisms in repairable systems. Assuming that the failure rate of the system parts is constant, the paper shows how the diesel generator system can be. Use these operators to combine terms when searching in electronic databases and search engines.
A powerful modeling framework for modelbased safety analysis of dynamic repairable and reconfigurable systems. To apply our method, the only requirement is to be able to construct the state space of the system regarding the. Three families of boolean functions of the time 23 process selectors if i is a root of a, then x. We propose a novel language that can capture mdpips and markov decision processes with setvalued transitions mdpsts we then obtain the complexity of onestep inference for the resulting mdpips and mdpsts. Logic sentences that can be expressed in classical propositional calculus have an equivalent expression in boolean algebra. Johnson and judy bowen and steve reeves and tiziana margaria and julia padberg and gabriele taentzer and chris w. Pdf on jun 1, 2009, marc bouissou and others published using bdmp boolean logic driven markov processes for multistate system analysis find, read and cite all the research you need on.
We propose to take advantage of their capabilities to go beyond the. These contributions are illustrated on a case study from power industry. A new formalism that combines advantages of faulttrees and. Accuracy integrity availability continuity time to alert. Modeling safety and security interdependencies with bdmp. A new formalism that combines advantages of faulttrees. A generalization of dynamic fault trees through boolean. Jun 21, 2012 journal of logic and computation, volume 24. Bouissou, modeling safety and security interdependencies with bdmp boolean logic driven markov processes, proceedings of the ieee international conference on systems, man, and cybernetics smc 2010, istanbul, turkia, pp. The \algebra of logic created by george boole in 1847, a.
Dynamic security modeling with bdmp boolean logic driven markov processes april 29th 2010 edcc8 2010, valencia, spain ludovic pietrecambacedes. Based on the structure and control logic of pwlcs, the bdmp model has been constructed by kb3 software, and quantitatively analyze is accomplished using yams to. Boolean logic driven markov processes, reliability engineering and system safety on deepdyve, the largest online rental service for scholarly research with thousands of academic publications available at your fingertips. This paper describes the state of the art on this open issue and presents a new approach based on bdmp boolean logic driven markov processes, allowing graphical modeling and advanced characterization of safety and security interdependencies. Preliminary system safety analysis with limited markov chain generation pierreantoine brameret, jeanmarc roussel, antoine rauzy. From dynamic faulttrees to boolean logic driven markov processes bdmp in the light of the observations made in the introduction, its seems obvious that two possibilities arise. Boolean logic definition of boolean logic by medical. Pdf using data analysis to enhance attack trees semantic. Suppose that the bus ridership in a city is studied. Npp, its digital control system also plays a decisive role in the safe operation of npp. A new formalism that combines advantages of faulttrees and markov models. Using assurance cases and boolean logic driven markov processes to formalise cyber security concerns for safetycritical interaction with global navigation satellite systems satellitebased location and timing systems support a wide range of mass market applications, typically using the gps infrastructure. In particular we show how this new approach can be seen as preferable to attack trees and petri netbased methods.
A new bayesian network approach to solve dynamic fault trees. This paper proposes an alternative to the most widely used kind of event tree, corresponding to the. The major contribution of this paper is to introduce a method for the sg reliability assessment sgra considering variable weather conditions, which provides an advantageous tool for the future power system reliability studies. An opensource application to model and solve dynamic fault. Boolean algebra is a branch of mathematics and it can be used to describe the manipulation and processing of binary information. Boolean logic driven markov processes bdmp are a powerful modeling tool used in the reliability and safety domains. The formal veri cation and controller synthesis for markov.
Optimal control of markov decision processes with linear. Boolean logic driven markov process listed as bdmp. Event trees are the core methodology of p robabilistic safety assessments psa in the nuclear industry. Consequently, the ship preserves four different diesel generators in addition to the power battery packs. Boolean logic driven markov processes april 29th 2010 edcc8 2010, valencia, spain. This is in fact the purpose of the new concept of boolean logic driven markov processes. It constitutes an attractive tradeoff in terms of readability, modeling power, scalability and quantification capabilities. For models with particularly complex interdependencies, bouissou 163, 164 offers a formalism called boolean logic driven markov processes bdmp as an extension to fault trees. Safety and security interactions modeling using the bdmp. In this paper, we will show on several examples that event trees can be replaced by bdmp, with the following advantages. Learning the structure of markov logic networks greater the difference in log probability between a world that satises the formula and one that does not, other things being equal. Pdf on sep 1, 2008, marc bouissou and others published bdmp boolean logic driven markov processes as an alternative to event trees.
What is the boolean logic expression for this operation. It has two advantages over conventional models used in dependability assessment. For models with particularly complex interdependencies, bouissou 163, 164 offers a formalism called boolean logic driven markov processes bdmp as. Johnson school of computing science, university of glasgow, glasgow, uk, g12 8rz. Weather boolean logic driven markov process vwbdmp, which is utilized along with statistical data. In our discussion we focus on twoelement boolean algebra brown 2003. Finding the minimal cut sequences of dynamic, repairable, and. Attackdefense trees1 journal of logic and computation. We call this formalism boolean logic driven markov processes bdmp. We study languages that specify markov decision processes with imprecise probabilities mdpips by mixing probabilities and logic programming. Markov processes are associated to the leaves actionsevents. Temporal logic control of general markov decision processes by approximate policy re nement so e haesaert1, sadegh soudjani2, and alessandro abate3 1 california institute of technology, united states 2 school of computing, newcastle university, united kingdom 3 computer science department, oxford university, united kingdom abstract. Dynamic fault trees dft and bdmp are both models resembling fault trees, whose function is to specify continuous time markov chains.
Pdf on jun 1, 2007, marc bouissou and others published a generalization of dynamic fault trees through boolean logic driven markov processes bdmp find, read and cite all the research you. The syntax and semantics of gbdmp generalized boolean logic driven markov processes are then formally defined. Pdf on jun 1, 2007, marc bouissou and others published a generalization of dynamic fault trees through boolean logic driven markov processes bdmp find, read and. Using assurance cases and boolean logic driven markov. This model analyzed risk scenarios in a qualitative and quantitative form, combining safety and security aspects. Bdmp boolean logic driven markov processes as an alternative to event trees m. Pdf using bdmp boolean logic driven markov processes for. This method relies on a modeling formalism called bdmp boolean logic driven markov processes that was initially created for safety studies, and then adapted to security. It has two advantages over conventional models used in.
These methods are tested on a dataset on atm attacks, and an attack tree model of an atm. This paper describes the generator operation and the main failure conditions. From a mathematical point of view, a bdmp is nothing more than a certain way to define a global markov. Modeling markov decision processes with imprecise probabilities using probabilistic logic programming. Smith calin belta daniela rus abstractin this paper, we develop a method to automatically generate a control policy for a dynamical system modeled as a markov decision process mdp. Boolean logic driven markov process bdmp is used to dynamic reliability analysis of digital pressurizer water level control system pwlcs. Preliminary system safety analysis with limited markov. Integrated risk management of hazardous processing facilities.
Reliability analysis of digital pressurizer water level. Some databases and search engines also support the use of proximity operators such as adjacent and near. This paper proposes an extension of the bdmp boolean logic driven markov processes formalism for enriching its capabilities to model replacement and. Pdf on jun 1, 2009, marc bouissou and others published using bdmp boolean logic driven markov processes for multistate system analysis find, read. We propose to take advantage of their capabilities to go beyond the traditional techniques used to model attack scenarios. Boolean functions and markov processes are all what is needed to define bdmp. We use the duality theory of riesz spaces to provide a connection between markov processes and the logic. Attack trees are a powerful graphical tool to investigate the security of a system.
But, despite the promises of researchers and the efforts of endusers, the dynamic paradox. Temporal logic control of general markov decision processes. In 1854 george boole introduced a systematic treatment of logic and developed for this purpose an algebraic system known as symbolic logic, or boolean algebra. A learning based approach to control synthesis of markov. Discrete control using programmable logic controllers chapter 9. Availability assessment of diesel generator system of a ship. The modeling capabilities of this framework are illustrated on three representative examples. Pdf modeling safety and security interdependencies with. The bdmp boolean logic driven markov processes formalism has been recently adapted from the dependability area bb03 to the security domain in order to. Johnson, title using assurance cases and boolean logic driven markov processes to formalise cyber security concerns for safetycritical interaction with global navigation. Boolean algebra, is at the core of logic synthesis.
The use of the method is first illustrated on a simple case to show how it can be used to make decisions in a situation where security requirements are in conflict with. Seshia abstractwe propose to synthesize a control policy for a markov decision process mdp such that the resulting traces. Abstractwe investigate a modal logic for expressing properties of markov processes whose semantics is realvalued, rather than boolean, and based on the mathematical theory of riesz spaces. The diesel generator set is one of the most critical systems for a ships operation. Bdmp boolean logic driven markov processes as an alternative to event trees. Their purpose is to allow the modelling of systems for which the.
1464 1405 740 193 584 565 1221 712 351 1401 1496 597 203 400 923 1309 334 1200 911 327 25 1513 277 604 339 919 57 527 1579 1436 546 166 673 1531 379 928 239 463 1222 725 204 891 392