The evolution of a design pattern typically involves the addition or removal of a group of modeling elements, such as classes, attributes, operations, and relationships. However, the possible evolutions of each design pattern are often not explicitly documented. Missing part of the evolution process may result in inconsistent evolution. In this paper, we define the evolution processes of design patterns in terms of two-level transformations, thus making the possible evolutions of each design pattern explicit. In addition, we automate the evolution processes as XSLT transformations that can transform the UML model of a design pattern application into the evolved UML model of the pattern. Both the original and evolved UML models are represented in the XML metadata interchange (XMI) format to facilitate the transformations. Furthermore, we check the consistency of the evolution results using the Java Theorem Prover
{"title":"A model transformation approach for design pattern evolutions","authors":"Jing Dong, Sheng Yang, Kang Zhang","doi":"10.1109/ECBS.2006.10","DOIUrl":"https://doi.org/10.1109/ECBS.2006.10","url":null,"abstract":"The evolution of a design pattern typically involves the addition or removal of a group of modeling elements, such as classes, attributes, operations, and relationships. However, the possible evolutions of each design pattern are often not explicitly documented. Missing part of the evolution process may result in inconsistent evolution. In this paper, we define the evolution processes of design patterns in terms of two-level transformations, thus making the possible evolutions of each design pattern explicit. In addition, we automate the evolution processes as XSLT transformations that can transform the UML model of a design pattern application into the evolved UML model of the pattern. Both the original and evolved UML models are represented in the XML metadata interchange (XMI) format to facilitate the transformations. Furthermore, we check the consistency of the evolution results using the Java Theorem Prover","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127934894","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}
In this paper, we describe the use of generic programming approach to design and implementation of a collection of basic model-checking algorithms on the .NET framework. The mentioned methodology separates algorithms and data structures similarly to Standard Template Library that allows delivering general and efficient algorithms. As the implementation environment does not enable us to exploit the advantages of static polymorphism provided by the C++ template parameterization we needed to adjust the approach for the use with the generics feature, which is the novel mechanism introduced with the second version of the .NET framework
{"title":"Designing algorithm-oriented generic library on .NET framework","authors":"O. Ryšavý, Frantisek Scuglik, M. Svéda","doi":"10.1109/ECBS.2006.36","DOIUrl":"https://doi.org/10.1109/ECBS.2006.36","url":null,"abstract":"In this paper, we describe the use of generic programming approach to design and implementation of a collection of basic model-checking algorithms on the .NET framework. The mentioned methodology separates algorithms and data structures similarly to Standard Template Library that allows delivering general and efficient algorithms. As the implementation environment does not enable us to exploit the advantages of static polymorphism provided by the C++ template parameterization we needed to adjust the approach for the use with the generics feature, which is the novel mechanism introduced with the second version of the .NET framework","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131690356","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}
Refactoring of software systems represents a fundamental way of improving their quality properties. Large-scale refactoring has to be performed at an architectural level to execute such changes for larger systems. Architecture-oriented refactoring requires decisions with multiple, partly contradicting objectives and uncertain consequences. To minimize risks and effort, the decisions about optimal refactoring alternatives have to be performed in a systematic way. In this paper decision theory is adapted to architecture-oriented refactoring. Methods for the evaluation of refactoring alternatives are shown which are applicable even to decisions with multiple and partly uncertain consequences. Furthermore, the complex decision process is structured in a rational way. In an example the effects of an increased quality requirement to architectural evolution are demonstrated
{"title":"Evaluating alternatives for architecture-oriented refactoring","authors":"Sven Wohlfarth, Matthias Riebisch","doi":"10.1109/ECBS.2006.40","DOIUrl":"https://doi.org/10.1109/ECBS.2006.40","url":null,"abstract":"Refactoring of software systems represents a fundamental way of improving their quality properties. Large-scale refactoring has to be performed at an architectural level to execute such changes for larger systems. Architecture-oriented refactoring requires decisions with multiple, partly contradicting objectives and uncertain consequences. To minimize risks and effort, the decisions about optimal refactoring alternatives have to be performed in a systematic way. In this paper decision theory is adapted to architecture-oriented refactoring. Methods for the evaluation of refactoring alternatives are shown which are applicable even to decisions with multiple and partly uncertain consequences. Furthermore, the complex decision process is structured in a rational way. In an example the effects of an increased quality requirement to architectural evolution are demonstrated","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123914445","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}
There exist several ways to augment Petri nets with time. The most popular approach is to assign times to transitions as time Petri nets (Merlin, 1974) or timed Petri nets (Ramchandani, 1974) do. It is, however, also possible to augment places, edges, or tokens of a Petri net with time. Within this paper we consider Petri nets with time augmented places as introduced in Coolahan and Roussopoulos (1983) which we call Petri nets with delaying places (PNDP). We present an approach that allows non-reachability to be proved in PNDP's using a state equation. Due to a lack of space, we only present our main results
{"title":"A state equation for Petri nets with delaying places","authors":"Matthias Werner, Gero Mühl","doi":"10.1109/ECBS.2006.16","DOIUrl":"https://doi.org/10.1109/ECBS.2006.16","url":null,"abstract":"There exist several ways to augment Petri nets with time. The most popular approach is to assign times to transitions as time Petri nets (Merlin, 1974) or timed Petri nets (Ramchandani, 1974) do. It is, however, also possible to augment places, edges, or tokens of a Petri net with time. Within this paper we consider Petri nets with time augmented places as introduced in Coolahan and Roussopoulos (1983) which we call Petri nets with delaying places (PNDP). We present an approach that allows non-reachability to be proved in PNDP's using a state equation. Due to a lack of space, we only present our main results","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123991427","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}
Architectural change heuristics are a very powerful mechanism for implementing architectural optimisation. They allow for both the capture of the systematic changes required to maintain system integrity and the often poorly understood rationale of expert knowledge. However, even though heuristics are one of the oldest and most widely used problem-solving mechanisms, they are also perhaps one of the most mis-used and ill-defined. In order to understand how heuristics can be used in optimising system architectures it is important to understand the nature of heuristics especially as they apply to architectural optimisation. This paper presents a framework that can be used to categorise and classify heuristics as they are used in system optimisation. It is anticipated that this framework will provide a common foundation within which to discuss heuristics in architectural optimisation
{"title":"A framework for understanding heuristics in architectural optimisation","authors":"C. Maxwell, T. O'Neill, J. Leaney","doi":"10.1109/ECBS.2006.6","DOIUrl":"https://doi.org/10.1109/ECBS.2006.6","url":null,"abstract":"Architectural change heuristics are a very powerful mechanism for implementing architectural optimisation. They allow for both the capture of the systematic changes required to maintain system integrity and the often poorly understood rationale of expert knowledge. However, even though heuristics are one of the oldest and most widely used problem-solving mechanisms, they are also perhaps one of the most mis-used and ill-defined. In order to understand how heuristics can be used in optimising system architectures it is important to understand the nature of heuristics especially as they apply to architectural optimisation. This paper presents a framework that can be used to categorise and classify heuristics as they are used in system optimisation. It is anticipated that this framework will provide a common foundation within which to discuss heuristics in architectural optimisation","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122530338","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}
Complex and distributed systems are more and more common. Hardware is going from strength to strength and is embedded in high performance peer-to-peer networks mostly. The task of a software engineer is to develop software systems which are able to take part in these new possibilities. Hereby, the drawback is the simple fact that such software systems and their modeling are getting more and more complex. If we are looking at the difficulties between customer and developer teams, especially misunderstandings between both, then the challenge to model customer oriented systems is even higher. For customers, it is hard to understand the frequently used terms, process models, and technological concepts. Developers have a hard time to understand domain specific processes and structures, and exhibit a tendency to abstract concrete examples to higher level constructs. These problems are especially hard to avoid during the development of dynamic, distributed systems with multiple nodes and possibly asynchronous behavior. In our research, we develop a customer-friendly reference model to demonstrate the aspects of dynamic distributed systems understandable to the customer. This model presents and simulates the dynamic aspects of (distributed) systems without immediate abstraction from examples and allows for a stepwise generalization and evaluation with help of the customer team. In its final version the reference model serves as a requirements statement for the professional developer
{"title":"Customer-oriented development of complex distributed systems","authors":"I. Erfurth","doi":"10.1109/ECBS.2006.33","DOIUrl":"https://doi.org/10.1109/ECBS.2006.33","url":null,"abstract":"Complex and distributed systems are more and more common. Hardware is going from strength to strength and is embedded in high performance peer-to-peer networks mostly. The task of a software engineer is to develop software systems which are able to take part in these new possibilities. Hereby, the drawback is the simple fact that such software systems and their modeling are getting more and more complex. If we are looking at the difficulties between customer and developer teams, especially misunderstandings between both, then the challenge to model customer oriented systems is even higher. For customers, it is hard to understand the frequently used terms, process models, and technological concepts. Developers have a hard time to understand domain specific processes and structures, and exhibit a tendency to abstract concrete examples to higher level constructs. These problems are especially hard to avoid during the development of dynamic, distributed systems with multiple nodes and possibly asynchronous behavior. In our research, we develop a customer-friendly reference model to demonstrate the aspects of dynamic distributed systems understandable to the customer. This model presents and simulates the dynamic aspects of (distributed) systems without immediate abstraction from examples and allows for a stepwise generalization and evaluation with help of the customer team. In its final version the reference model serves as a requirements statement for the professional developer","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"1740 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129459353","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}
In this paper, we propose an equivalent model in a serial queue for representing the serial connection of the load balancer and a Web server of the Web cluster. We have set up an experimental Web cluster for doing some performance measurements. Moreover, we compare either the simulation results or the measurement results for the mean system response time of the serial queues forming the equivalent model which in turn has the supposition property derived by the use of two subsystems
{"title":"An analysis and measurement of the equivalent model of serial queues for a load balancer and a Web server of a Web cluster with a low rejection rate","authors":"Ying-Wen Bai, Yu-Nien Yang","doi":"10.1109/ECBS.2006.22","DOIUrl":"https://doi.org/10.1109/ECBS.2006.22","url":null,"abstract":"In this paper, we propose an equivalent model in a serial queue for representing the serial connection of the load balancer and a Web server of the Web cluster. We have set up an experimental Web cluster for doing some performance measurements. Moreover, we compare either the simulation results or the measurement results for the mean system response time of the serial queues forming the equivalent model which in turn has the supposition property derived by the use of two subsystems","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127059178","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}
In this paper, we aim at capturing the industrial viewpoint of today's and future requirements in development of embedded real-time systems. We do this by interviewing ten senior designers at four Swedish companies, developing embedded applications in the vehicle domain. This study shows that reliability and safety are the main properties in focus during development. It also shows that the amount of functionality has been increasing in the examined systems. Still the present requirements are fulfilled using considerably homogenous development methods. The study also shows that, in the future, there will be even stronger requirements on dependability and control performance at the same time as requirements on more softer and resource demanding functionality will continue to increase. Consequently, the complexity will increase, and with diverging requirements, more heterogeneous development methods are called for to fulfil all application specific requirements
{"title":"Present and future requirements in developing industrial embedded real-time systems - interviews with designers in the vehicle domain","authors":"Kaj Hänninen, Jukka Mäki-Turja, Mikael Nolin","doi":"10.1109/ECBS.2006.56","DOIUrl":"https://doi.org/10.1109/ECBS.2006.56","url":null,"abstract":"In this paper, we aim at capturing the industrial viewpoint of today's and future requirements in development of embedded real-time systems. We do this by interviewing ten senior designers at four Swedish companies, developing embedded applications in the vehicle domain. This study shows that reliability and safety are the main properties in focus during development. It also shows that the amount of functionality has been increasing in the examined systems. Still the present requirements are fulfilled using considerably homogenous development methods. The study also shows that, in the future, there will be even stronger requirements on dependability and control performance at the same time as requirements on more softer and resource demanding functionality will continue to increase. Consequently, the complexity will increase, and with diverging requirements, more heterogeneous development methods are called for to fulfil all application specific requirements","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133458229","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}
Many variability modeling approaches consider only formalized dependencies, i.e. in- or exclude relations between variants. However, in real industrial product families, dependencies are often much more complicated. In this paper, we discuss the product derivation problems associated with dependencies, and show how our variability modeling framework COVAMOF addresses these issues. Throughout the paper, we use examples of Intrada, an intelligent traffic systems family of Dacolian B.V
{"title":"Modeling dependencies in product families with COVAMOF","authors":"Marco Sinnema, S. Deelstra, J. Nijhuis, J. Bosch","doi":"10.1109/ECBS.2006.49","DOIUrl":"https://doi.org/10.1109/ECBS.2006.49","url":null,"abstract":"Many variability modeling approaches consider only formalized dependencies, i.e. in- or exclude relations between variants. However, in real industrial product families, dependencies are often much more complicated. In this paper, we discuss the product derivation problems associated with dependencies, and show how our variability modeling framework COVAMOF addresses these issues. Throughout the paper, we use examples of Intrada, an intelligent traffic systems family of Dacolian B.V","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116783125","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}
This paper describes the results of a survey about the problems of and solutions for collaborative SW development. The survey was done through several interviews of companies doing collaborative development and also through a literature search to find already published experiences and solutions. As a result, we found that the literature focuses on solutions for more general issues like communication and team building, and industrial problems are related to specific engineering tasks. Mapping and practical examples of general solutions to specific tasks are needed to support collaborative software development
{"title":"Collaborative embedded systems development: survey of state of the practice","authors":"Jarkko Hyysalo, P. Parviainen, Maarit Tihinen","doi":"10.1109/ECBS.2006.29","DOIUrl":"https://doi.org/10.1109/ECBS.2006.29","url":null,"abstract":"This paper describes the results of a survey about the problems of and solutions for collaborative SW development. The survey was done through several interviews of companies doing collaborative development and also through a literature search to find already published experiences and solutions. As a result, we found that the literature focuses on solutions for more general issues like communication and team building, and industrial problems are related to specific engineering tasks. Mapping and practical examples of general solutions to specific tasks are needed to support collaborative software development","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121600749","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：