{"title":"Reliability Centered Maintenance of Repairable Equipment","authors":"H. Maciejewski","doi":"10.1109/DepCoS-RELCOMEX.2009.19","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.19","url":null,"abstract":"This work reviews several approaches to analysis of repairable systems failure/repair history in order to obtain estimates of reliability measures useful for making conscious maintenance/ preventive replacement decisions. These approaches are based on empirical models of reliability of repairable systems (including MFC curves, Duane power-law model, etc). We also discuss how these models of reliability can be extended to modeling the effect of maintenance, which can be very useful for maintenance policy optimization. The concepts discussed are illustrated by numerical examples based on real repair records from technical systems and probabilistic models pertaining to power station equipment.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115492410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Minimal Büchi Automata for Certain Classes of LTL Formulas","authors":"J. Cichon, Adam Czubak, Andrzej Jasinski","doi":"10.1109/DepCoS-RELCOMEX.2009.31","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.31","url":null,"abstract":"In this paper we calculate the minimal number of states of Buchi automata which encode some classes of linear temporal logic (LTL) formulas that are frequently used in model checking. Our results may be used for verification of the quality of algorithms which automatically translate LTL formulas into Buchi automata and for improving the quality and speed of such translators. In the last section of this paper we compare our lower-bound estimations to Buchi automata generated by two currently used translators: LTL2BA and SPOT.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117066038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of Possibilities and Effectiveness of Combine Rough Sets and Neighborhood Theories for Solving Dynamic Scheduling Problem","authors":"H. Piech","doi":"10.1109/DepCoS-RELCOMEX.2009.36","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.36","url":null,"abstract":"In our paper we considered dynamic tasks scheduling problem. To solve this problem we try applying both characteristics of rough sets and neighborhood theories (theory name introduced for temporary use). Among rough sets characteristics we can quote proposal of Slovinski et al.: outranking parameter, reference ranking, cumulated preference etc. Among neighborhood characteristics we can appoint Jaroń, Nikodem et al. terms such as subordinate, tolerance and collision. The tasks succeeding process has an asynchronous character. However, tasks assigning and loading to actual processor is done in regular time intervals. The tasks choice problem is supported by several approximate scheduling algorithm. Usually the complexity of this kind of algorithms is much lower than of precise algorithms. According to tasks placements appointed by every algorithm a dynamic data table is created. This data table provides information on estimations of both characteristics types, which support inference process of tasks sequencing in a form of final scheduling list. Using consolidated approach we simplify inference organization and obtain tools for taking into account dispersed tasks locations according to different algorithms.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"13 41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125716568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of Critical Situations in Discrete Transport Systems","authors":"T. Walkowiak, J. Mazurkiewicz","doi":"10.1109/DepCoS-RELCOMEX.2009.39","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.39","url":null,"abstract":"A paper presents an approach to critical situations analysis related to discrete transport systems (DTS). The critical situation is understood as sudden shortage of some system recourses resulting in the transport system performance degradation. The analysis is realized based on availability calculation of DTS. The system is described by the formal model, which includes reliability and functional parameters of DTS. The availability and average availability of the system - defined in a functional way by delayed tasks realization – is discussed as a function of different essential parameters when the DTS is organized. The proposed analysis is based on the modeling and simulating of the system behavior using Monte-Carlo approach. The paper presents some exemplar systems – based on real Polish Post DTS - modeling and results.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128802504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Kharchenko, Vladimir V. Sklyar, Alexander Siora
{"title":"Dependability of Safety-Critical Computer Systems through Component-Based Evolution","authors":"V. Kharchenko, Vladimir V. Sklyar, Alexander Siora","doi":"10.1109/DepCoS-RELCOMEX.2009.22","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.22","url":null,"abstract":"Modification causes of safety-critical computer systems and its components and procedures of evolution analysis are discussed in the paper. An evolutional-component model of computer systems has been developed for evoluability assessment. This model is applied to formalize analysis of pre-developed software and hardware OTS-components by use of vector operations in structured multilevel space “functions–components”. A special metrics are proposed to assess a value of modification.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133438729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Node Evaluation in the Chord P2P Systems","authors":"J. Cichon, Krzysztof Cichon, P. Kobylanski","doi":"10.1109/DepCoS-RELCOMEX.2009.32","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.32","url":null,"abstract":"In this paper we investigate two statistical estimators for the number of nodes in the Chord peer-to-peer system and one estimator for the number of information items stored in the system. The first estimator of the number of nodes is based on the Maximum Likelihood Estimation (MLE) technology and the second is based on the Methods of Moments (MM). We compare its statistical properties, show that the MM estimator has a better properties for our purposes and we discuss how we can implement this estimators in the Chord system.Our solutions can be implemented in Chord in such a way that they do not require any additional transmissions since all necessary information can be gathered during the standard operations of checking consistency of the Chord structure.Our results can be applied not only to the Chord P2P system but can be adopted to other decentralized and structured systems.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"11 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132473554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modifying Markov Models of Ageing Equipment for Modeling Changes in Maintenance Policies","authors":"J. Sugier, G. Anders","doi":"10.1109/DepCoS-RELCOMEX.2009.23","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.23","url":null,"abstract":"The paper presents a method for adjustments of parameters of Markov models representing ageing equipment. The adjustment procedure begins with some basic model that represents both the equipment ageing and various maintenance activities. The solution of the model gives, among other results, the frequencies of the repair states. These frequencies are also known from maintenance records. The proposed method automatically adjusts model’s internal parameters so that the computed and actual frequencies of repairs match. The paper describes structure of the Markov model, presents main steps of the adjustment procedure, discusses different numerical implementations of the crucial step of probability tuning, then presents two case studies that show results of the method and identify essential characteristics of the model that are vital for successful reaching the adjustment goal.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121974900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ontology Oriented Threat Detection System (OOTDS)","authors":"K. Banczyk, H. Krawczyk","doi":"10.1109/DepCoS-RELCOMEX.2009.45","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.45","url":null,"abstract":"The paper discusses the design of a general purpose ontology oriented threat detection system (OOTDS) for environments monitored by sensors. The sensors are assumed to continually provide OOTDS with events reflecting changes in the environment. OOTDS performs event analysis using a network of asynchronous blocks with increasing complexity. Front blocks convert sensor specific events to a unified form. A suggestion block provides hints for threat assessment based on a set of rules. The core threat detection block estimates probabilities of the suggested threats using Multi-Entities Bayesian Networks (MEBN) logic inference based on facts resulting from observed events and knowledge stored in an environment specific threat detection ontology (TDO). Threats with sufficiently high probability levels result in notifications sent to concerned users.The paper defines main OOTDS goals and presents its architecture followed by a short introduction to MEBN logic and an exemplary OOTDS application with a usage scenario.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"107 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125796526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Detecting Botnets in Computer Networks Using Multi-agent Technology","authors":"M. Szymczyk","doi":"10.1109/DepCoS-RELCOMEX.2009.46","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.46","url":null,"abstract":"The paper presents a hybrid model of the bots detector which is a combination of host intrusion detection system and the operating system event log analyzer. Bot can be defined as a computer that have been attacked by a hacker or infected with malicious software and is used for illegal activities. Collections of infected computers form a botnet. The proposed system is used to detect bots based on the evaluation of events occurring in the operating system and network environment. Detection algorithms based on the signatures derived from the analysis of the various types of malicious software that creates bots. The model has been implemented using multi-agent technology.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130409134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Iraj Elyasi-Komari, V. Kharchenko, E. Babeshko, A. Gorbenko, Alexander Siora
{"title":"Extended Dependability Analysis of Information and Control Systems by FME(C)A-technique: Models, Procedures, Application","authors":"Iraj Elyasi-Komari, V. Kharchenko, E. Babeshko, A. Gorbenko, Alexander Siora","doi":"10.1109/DepCoS-RELCOMEX.2009.13","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.13","url":null,"abstract":"This paper addresses the problems associated with dependability analysis of complex information and control systems (I&CS). FME(C)A-technique is proposed as a unified approach to I&CS dependability assessment. Classic philosophy is extended by introducing new items into assessed objects, relevant causes, assessed effects, assessed attributes and used means. FME(¿)¿-tables and models for dependability (reliability,survivability and safety) attributes assessment are constructed. Elements of information technology of I&CS analysis are presented.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130908347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}