{"title":"Separating Users' Views in a Development Process for Agile Methods","authors":"A. Bessam, M. Kimour, A. Melit","doi":"10.1109/DepCoS-RELCOMEX.2009.16","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.16","url":null,"abstract":"Agile methods require a rigorous development process that takes into account a permanent involvement of user in all development steps. Several advanced researches have treated the various aspects of agile development methods. However, they lack rigorous and specific processes based on explicit and detailed definition of users’ organization and interaction during development process. In this paper, we have suggested an approach that guides software projects managers in assignment of integrated users in development process. The basic definition of this process is based on a set of layers represented by nested circles. Circles from the center to the external surface represent, respectively, initial or starting users’ requirements, software architecture, design level and codification level. These layers are decomposed into slices from the center to the external circle. Each slice represents a different view that corresponds to a specific class of users. In our process, developers have not constrained by a specific views approach, they can choose the appropriate views approach from the literature (e.g. 4+1 view approach). Initial requirements, in this process, are represented by an extension of use case diagram definition of UML. The proposed process is driven by requirements. It is used for large software systems developed by a numerous and heterogeneous development teams. The developed process is characterized by its simplicity, and it can be easily adapted for other agile processes.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"17 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":"131638790","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":"Operational Availability of Railway Dispatch Communication System","authors":"M. Siergiejczyk","doi":"10.1109/DepCoS-RELCOMEX.2009.28","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.28","url":null,"abstract":"In the article, issues on assessment of operational availability of transport telematic systems are presented. Digital railway dispatch communication system has been selected for analysis and assessment. Presented has been the model of the system’s exploitation process, including its functional structure. Markov and semi-Markov processes have been used for modelling of the exploitation process. The conclusion contains the example of a computation of operational availability of the digital railway dispatch communication system.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"16 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":"133731754","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":"Dependability of Large Reconfigurable Information Systems","authors":"D. Caban","doi":"10.1109/DepCoS-RELCOMEX.2009.44","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.44","url":null,"abstract":"The paper presents an approach to dependability analysis of an information system based on interdependent services. The analyzed system consists of autonomous cells of servers that react automatically to detected events (component failures and security incidents). These local reactions cause disruptions in the global workflow, which is then restored by system reconfiguration at higher levels of system management. The dependability analysis is based on the construction of system reconfiguration graph and evaluation of the service availability.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"38 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":"130857872","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":"Siphon-Based Verification of Component Compatibility","authors":"W. M. Zuberek","doi":"10.1109/DepCoS-RELCOMEX.2009.35","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.35","url":null,"abstract":"In component-based systems, two interacting components are compatible if any sequence of services requested by one component can be provided by the other. This concept of compatibility can easily be extended to a set of interacting components. Checking the compatibility of interacting components is essential for any dependable software system. Recently, an approach to verification of component compatibility has been proposed in which the behavior of individual components (at component interfaces) was modeled by labeled Petri nets. Moreover, the composition of interacting components was designed in such a way that all component incompatibilities were manifested by deadlocks in the composed model. Consequently, the verification of component compatibility is performed by deadlock analysis of the composed model. One of techniques for deadlock analysis is based on net structures called siphons. Siphon-based verification of component compatibility is the subject of this paper.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"32 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":"131078400","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":"The Design and Implementation of a Documentation Generator for the PRISM Language","authors":"H. Dworak","doi":"10.1109/DepCoS-RELCOMEX.2009.29","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.29","url":null,"abstract":"PRISM is a tool for formal modelling and analysis of systems which exhibit random or probabilistic behaviour. Having developed a documentation generator for its language, we explain the design and the corresponding implementation of our extension to PRISM. The paper consists of a study of the unobtrusive enhancements to the parser of the original code base in order to construct software analogous to Javadoc. On the basis of our findings, one could follow the same pattern to build similar tools for other specification or programming languages. Furthermore, we describe the resulting software, which can facilitate the research within the field of the dependability of computer systems.","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":"131338940","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":"A Domain Specific Language in Dependability Analysis","authors":"M. Kowalski, K. Wilkosz","doi":"10.1109/DepCoS-RELCOMEX.2009.14","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.14","url":null,"abstract":"Domain Specific Languages gain increasing popularity as they substantially leverage software development by bridging the gap between technical and business area. After a domain framework is produced, experts gain an effective vehicle for assessing quality and performance of a system in the business-specific context. We consider the domain to be dependability of Multi-Agent System (MAS), for which a key requirement is an efficient verification of a topology model of a power system. As a result, we come up with a reliability evaluation solution offering a significant rise in the level of abstraction towards MAS utilized for purposes of a power system topology verification.. By means of the mentioned solution safety engineers are enabled to perform analysis while the design is still incomplete.A new DSL is developed in XText in order to specify a structure of the system together with dependability extensions, which are further translated into Dynamic Fault Trees using Model to Model Transformations. The Eclipse Ecore becomes a common denominator, in which both metamodels’ Abstract Syntax Trees are defined. Finally, an expert is offered with two ways of defining a model: through abstract and textual concrete syntax, both of which are checked for consistency using Object Constraint Language.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"10 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":"117225856","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":"A Concept of a Web Application Blending Thin and Fat Client Architectures","authors":"H. Dworak","doi":"10.1109/DepCoS-RELCOMEX.2009.9","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.9","url":null,"abstract":"Rich Internet applications and Web application frameworks treat user agents as either thin or fat clients. Whereas the former approach does not take advantage of the increasing potential of modern Web browsers, the latter requires the availability of their scripting engine. Although the majority of users allow the source code to be interpreted by their clients, some consider it to be a security threat and forbid its use. Moreover, not all user agents support scripting, thus the requirement of code execution constitutes a Web accessibility issue. We propose an architecture allowing software developers to build modern Web applications with equivalent functionality regardless of whether the user agent supports client-side scripting. The concept eliminates the need to rewrite the code base in a server-side language and requires no customisation of other layers of a Web application.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"26 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":"123619296","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":"Data Mining Techniques for Semi-automatic Signature Generation","authors":"W. Tylman","doi":"10.1109/DepCoS-RELCOMEX.2009.24","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.24","url":null,"abstract":"This paper presents a novel approach to the task of semi-automatic generation of signatures for misuse-based network intrusion detection. The presented approach is a part of a Basset system, a hybrid misuse-anomaly solution employing Bayesian networks. The signature generation part is intended to work with data received from the Bayesian network, in turn providing the network with signatures for novel attacks.","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":"131560408","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":"Languages of CTL and RTCTL Calculi in Real-Time Analysis of a System Described by a Fault Tree with Time Dependencies","authors":"P. Głuchowski","doi":"10.1109/DepCoS-RELCOMEX.2009.12","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.12","url":null,"abstract":"Minimal cut sets are one of the main results of analysis of fault trees with time dependencies. They contain events leading to a hazard (root of the tree). The events have minimal and maximal time intervals from both their start and end times to the possible appearance of the hazard. These informations may be useful in real-time operation of a system, for which the fault tree was constructed. To achieve it, while observing the working system, the real start and end times of events from the minimal cut sets must be registered to predict the time remaining to the hazard - possibly the time still left to repair a damage, to run a safety procedure, or even to halt the system before it crashes.This article presents a use of languages of CTL and RTCTL calculi in a description of the minimal cut sets and then a use of such a description in deductive real-time analysis of the described system.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"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":"126393881","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":"On Complexity of Coordination of Parallel Graph Transformations in GRADIS Framework","authors":"L. Kotulski, A. Sȩdziwy","doi":"10.1109/DepCoS-RELCOMEX.2009.51","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.51","url":null,"abstract":"The graph transformations are very intuitive and precise way of modeling and specifying the systems. A wide range of applications supporting the visual modeling techniques, especially in the UML context,are supported by graph transformation techniques. The complementary graphs concept enables applying the distributed and parallel transformations using rules designed for the centralized transformations. This concept is supported by the GRADIS agent framework.The aim of the paper is to prove that in the case of the single pushout transformations, being one of the most popular mechanism of graph transformations - the algorithm of the agents (maintaining local graphs)coordination has polynomial complexity and it is time dependent errors and deadlock free.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"55 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":"126449941","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}