{"title":"Model driven embedded systems","authors":"I. Oliver","doi":"10.1109/CSD.2003.1207694","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207694","url":null,"abstract":"Summary form only given. We are now at a stage in the development of embedded systems where the complexity of the software development and the software itself needs to be managed not via code but via models. This move to a more abstract representation of the system brings many new challenges to primarily the methodology and the style of system development. The Object Management Group's (OMG) model driven architecture (MDA) is an initiative towards fully model based software development. The advantages of taking a (or even the) model driven approach is that we can abstract from the system at many levels and take advantage of well known \"large scale software\" techniques.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122882010","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}
J. Romberg, J. Jürjens, Guido Wimmel, O. Slotosch, G. Hahn
{"title":"AutoFOCUS and the MoDe tool","authors":"J. Romberg, J. Jürjens, Guido Wimmel, O. Slotosch, G. Hahn","doi":"10.1109/CSD.2003.1207727","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207727","url":null,"abstract":"Software engineering for distributed automotive applications is shifting from a subsystem-level perspective, where the focus is on optimization of a single electronic control unit, towards a system-level view. However, optimization of distributed systems with respect to non-functional properties remains a challenging task. The goal of the MoDe (model based deployment) approach is to give early guidance for design decisions using architectural-level models of the system. In its current version, MoDe supports those architecture-level decisions that require a performance model of the overall system. The MoDe approach is based on a formal design notation, AutoFocus, which is used for specifying system models, functional models enriched with abstractions for communication and scheduling. The MoDe tool offers automated support for compiling platform abstractions into the system model, so MoDe allows a highly flexible evaluation of different architectural choices.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126351410","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":"Specification coverage aided test selection","authors":"Tuomo Pyhälä, Keijo Heljanko","doi":"10.1109/CSD.2003.1207713","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207713","url":null,"abstract":"Here, we consider test selection strategies in formal conformance testing. As the testing conformance relation we use the ioco relation, and extend the previously presented on-the-fly test generation algorithms for ioco to include test selection heuristic based on a specification coverage metric. The proposed method combines a greedy test selection with randomization to guarantee completeness. As a novel implementation technique we employ bounded model checking for lookahead in greedy test selection.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121939926","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}
Vincent Beaudenon, Emmanuelle Encrenaz-Tiphène, J. Desbarbieux
{"title":"Design validation of ZCSP with SPIN","authors":"Vincent Beaudenon, Emmanuelle Encrenaz-Tiphène, J. Desbarbieux","doi":"10.1109/CSD.2003.1207704","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207704","url":null,"abstract":"We consider the problem of specifying a model of the zero copy secured protocol for the purpose of LTL verification with the SPIN model checker. ZCSP is based on direct memory access. Data is directly read/written in user space memory, decreasing latency and saving processor computing time. We first introduce the ZCSP protocol before analysing different ways of modelling it. Two main steps were performed: a finite and a nonfinite sequences model. The first model gave us an overview of the protocol robustness. The second allowed us to test realistic properties. We also describe LTL properties that were checked with the SPIN model checker. Unfortunately, the size of the system was frequently prohibitive. Thus, we explain all minimization steps we had to perform: variables' domains restriction, interleaving reduction, realistic environment representation by fairness constraints.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124139368","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":"Modelling a secure, mobile, and transactional system with CO-OPN","authors":"Didier Buchs, S. Chachkov, David Hurzeler","doi":"10.1109/CSD.2003.1207702","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207702","url":null,"abstract":"Modelling complex concurrent systems is often difficult and error-prone, in particular when new concepts coming from advanced practical applications are considered. These new application domains include dynamicity, mobility, security, and localization dependent computing. In order to fully model and prototype such systems we propose to use several concepts existing in our specification language CO-OPN, like context, dynamicity, mobility, subtyping, and inheritance. CO-OPN (concurrent object oriented Petri net) is a formal specification language for modelling distributed systems; it is based on coordinated algebraic Petri nets. We focus on the use of several basic mechanisms of CO-OPN for modelling mobile systems and the generation of corresponding Java code. A significant example of distributors accessible through mobile devices (for example, PDA with Bluetooth) is fully modelled and implemented with our technique.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124459880","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":"Component-based design: towards guided composition","authors":"S. Moschoyiannis, M. W. Shields","doi":"10.1109/CSD.2003.1207706","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207706","url":null,"abstract":"We present a mathematical model for the composition of software components, at a semantic modelling level. We describe a mathematical concept of a single software component and identify properties that ensure its potential behaviour can be captured. Based on that, we give a formal definition of composition and examine its effect on the individual components. We argue that properties of the individual components can, under certain conditions, be preserved in the composite. The proposed model can be used for guiding the composition of components as it advocates formal reasoning about the composite before the actual composition takes place.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130981055","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}
Y. Bontemps, Pierre-Yves Schobbens, Christof Löding
{"title":"Synthesis of open reactive systems from scenario-based specifications","authors":"Y. Bontemps, Pierre-Yves Schobbens, Christof Löding","doi":"10.1109/CSD.2003.1207698","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207698","url":null,"abstract":"We propose here live sequence charts with a new, game-based semantics to model interactions between the system and its environment. For constructing programs automatically, we give an algorithm to synthesize either a strategy for the system ensuring that the specification is respected, or, if the specification is unimplementable, a strategy for the environment forcing the system to fail.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126622326","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":"Communicating transaction processes","authors":"Abhik Roychoudhury, P. Thiagarajan","doi":"10.1109/CSD.2003.1207710","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207710","url":null,"abstract":"Message sequence charts (MSC) have been traditionally used to depict execution scenarios in the early stages of design cycle. MSCs portray inter-process (inter-object) interactions. Synthesizing intra-process (intra-object) executable specifications from an MSC-based description is a nontrivial task. Here we present a model called communicating transaction processes (CTP) based on MSCs from which an executable specification can be extracted in a straight forward manner. Our model describes a network of communicating processes as a collection of high-level labeled transition systems, where processes interact via common action labels. Each action is a nonatomic interaction which is described by a guarded choice of MSCs. Thus our model achieves a separation of concerns: the high-level transition systems depicting intra-process control flow, while the actions in the transition system capture inter-process interaction via MSCs. We show how to extract an ordinary Petri net from a CTP model thereby leading to a standard operational semantics. We also discuss the connection of our formalism to live sequence charts, an extension of MSCs which also has an executable semantics.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"26 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114030388","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 polynomial-time algorithm for checking consistency of free-choice signal transition graphs","authors":"J. Esparza","doi":"10.1109/CSD.2003.1207700","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207700","url":null,"abstract":"Signal transition graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent and complete binary encoding. Checking this is EXPSPACE-hard for arbitrary STGs, and so a lot of attention has been devoted to the subclass of free-choice STGs, which offers a good compromise between expressive power and analyzability. In the last years, polynomial time synthesis techniques have been developed for free-choice STGs, but they assume that the STG has a consistent binary encoding. The first polynomial algorithm for checking consistency is presented here.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134011501","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":"Separation of concerns in the formal design of real-time shared data-space systems","authors":"M. Mousavi, M. Reniers, T. Basten, M. Chaudron","doi":"10.1109/CSD.2003.1207701","DOIUrl":"https://doi.org/10.1109/CSD.2003.1207701","url":null,"abstract":"We propose a formal framework for the design of real-time shared data-space systems. The proposed method separates the concerns of functionality, behavior, and timing. This work exploits the idea of separation of concerns at the specification and design level, and it establishes a robust theoretical basis that allows rigid analysis and verification of (timed) designs.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129273521","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}