{"title":"Communicating complex systems","authors":"P. Welch, F. Barnes, F. Polack","doi":"10.1109/ICECCS.2006.53","DOIUrl":"https://doi.org/10.1109/ICECCS.2006.53","url":null,"abstract":"This paper presents efficient mechanisms for the direct implementation of formal models of highly concurrent dynamic systems. The formalisms captured are CSP (for concurrency) and B (for state transformation). The technology is driving the development of occam-pi, a multiprocessing language based on a careful combination of ideas from Hoare's CSP (giving compositional semantics, refinement and safety/liveness analysis) and Milner's pi-calculus (giving dynamic network construction and mobility). We have been experimenting with systems developing as layered networks of self-organising neighbourhood-aware communicating processes, with no need for advanced planning or centralised control. The work reported is part of our TUNA (`Theory Underpinning Nanotech Assemblers') project, a partnership with colleagues from the Universities of York, Surrey and Kent, which is investigating formal approaches to the capture of safe emergent behaviour in highly complex systems. A particular study modelling artificial blood platelets is described. A novel contribution reported here is a fast resolution of (CSP external) choice between multiway process synchronisations from which any participant may withdraw its offer at any time. The software technology scales to millions of processes per processor and distributes over common multiprocessor clusters","PeriodicalId":269321,"journal":{"name":"11th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'06)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129804524","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":"An assertional correctness proof of a self-stabilizing /spl lscr/-exclusion algorithm","authors":"M. Besta, F. Stomp","doi":"10.1109/ICECCS.2006.49","DOIUrl":"https://doi.org/10.1109/ICECCS.2006.49","url":null,"abstract":"A formal correctness proof of a self-stabilizing lscr-exclusion algorithm (SLEX) is described. The analyzed algorithm is an improvement of the SLEX due to Abraham, Dolev, Herman, and Koll, since our version satisfies a stronger liveness property. The proof is formulated in linear-time temporal logic and utilizes a history variable to model access to regular registers. The proof consists of a safety part and a liveness part. Our analysis provides some new insight in the correctness of the algorithm: (1) our proof is constructive. That is, we explicitly formulate auxiliary quantities required to establish some of the properties. This contrasts with the operational arguments of Abraham et al., where many quantities are not explicitly formulated and the validity of the above mentioned properties are established by disproving their non-existence. (2) We characterize processes (and their minimum number) identified by some process as attempting to enter the critical section. (3) A novel proof rule for reasoning about programs in the presence of disabled processes is presented to structure the liveness proof","PeriodicalId":269321,"journal":{"name":"11th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'06)","volume":"147 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114106588","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":"Formal specification-based online monitoring","authors":"Hui Liang, J. Dong, Jing Sun, R. Duke, R. Seviora","doi":"10.1109/ICECCS.2006.56","DOIUrl":"https://doi.org/10.1109/ICECCS.2006.56","url":null,"abstract":"With current trends towards more complex software system and use of higher level languages, a monitoring technique is of increasing importance for the areas such as performance enhancement, dependability, correctness checking and so on. In this paper, we present a formal specification-based online monitoring technique. The key idea of our technique is to build a linking system, which connects a specification animator and a program debugger. The required information about dynamic behaviors of the formal specification and concrete implementation of a target system is obtained from the animator and the debugger. Based on that information, the judgment on the consistency of the concrete implementation with the formal specification will be provided. Not embedding any instrumentation code into the target system, our monitoring technique will not alter the dynamic behavior of the target system. Animating the formal specification, rather than annotating the target system with extra formal specifications, our monitoring technique separates the implementation-dependent description of the monitored objects and the formal requirement specification of them","PeriodicalId":269321,"journal":{"name":"11th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125078946","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":"Model-based design of distributed collaborative bioinformatics processes in the jABC","authors":"T. Margaria, C. Kubczak, M. Njoku, B. Steffen","doi":"10.1109/ICECCS.2006.61","DOIUrl":"https://doi.org/10.1109/ICECCS.2006.61","url":null,"abstract":"Our approach to the model-driven collaborative design of workflows for bioinformatic applications uses the jABC for model driven mediation and choreography to complement a Web service-based elementary service provision. jABC is a framework for service development based on lightweight process coordination. Users (product developers and system/software designers) develop services and applications by composing reusable building-blocks into (flow-)graph structures that can be animated, analyzed, simulated, verified, executed, and compiled. This way of handling the collaborative design of complex processes has proven to be effective and adequate for the cooperation of non-programmers (in this case biologists) and technical people, and it is now being rolled out in the operative practice","PeriodicalId":269321,"journal":{"name":"11th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'06)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126026065","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":"Modeling bacterial growth patterns in the presence of antibiotic","authors":"Ray Walshe","doi":"10.1109/ICECCS.2006.62","DOIUrl":"https://doi.org/10.1109/ICECCS.2006.62","url":null,"abstract":"With recent growth in systems biology research there has been a significant increase in complex systems modeling research relating to biological systems. Multi-drug resistant (MDR) organisms are a threat not only as hospital-acquired infections, but also now as community-acquired infections. Multilocus sequence typing (MLST) can genetically characterize clones of several bacterial pathogens, allowing the tracking of hypervirulent/ antibiotic resistant lineages and the extent of acquisition and horizontal movement of the resistance genes by Feil, E.J., et al, (2004). This paper describes the initial research using an agent based cellular automata approach to model the complex sub-cellular processes in bacteria growth. Rules derived from a biological background simulate the growth of bacteria under a number of conditions including the presence of antibiotic. Altering the level of antibiotic in the bacteria environment and effects on the growth curves was explored and verified. Bacterial survival under a number of conditions (pH, temperature, nutrient concentration) emergent growth patterns and collective behaviour were also studied. A case study using the parameters reflecting the bacterium Escherichia coli was simulated and the results were validated. The software provides an in silico laboratory where bacteria can be grown under a variety of rules and conditions thereby learning the underlying mechanisms of behaviour at a local level, which collectively generate the global behaviour of interest","PeriodicalId":269321,"journal":{"name":"11th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'06)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115757709","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":"Inference of design pattern instances in UML models via logic programming","authors":"Dae-Kyoo Kim, Lunjin Lu","doi":"10.1109/ICECCS.2006.58","DOIUrl":"https://doi.org/10.1109/ICECCS.2006.58","url":null,"abstract":"This paper formalizes the notion of a design model structurally conforming to a design pattern by representing the model as a logic program whilst the pattern as a query. The conformance of a model to a design pattern is equivalent to the satisfaction of the query by the logic program. Harnessing logic inference capability of logic programming languages, we obtain an automated method that infers all the instances of a design pattern in a UML class diagram. We use the visitor pattern and a price calculation application to demonstrate the technique","PeriodicalId":269321,"journal":{"name":"11th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'06)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114166937","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":"Integrating timed automata into tabu algorithm for HW-SW partitioning","authors":"G. Pu, Chong Zhang, Z. Qiu, Jifeng He, W. Yi","doi":"10.1109/ICECCS.2006.60","DOIUrl":"https://doi.org/10.1109/ICECCS.2006.60","url":null,"abstract":"Hardware/software (HW-SW) partitioning is a key problem in codesign of embedded systems, studied extensively in the past. This paper describes a new approach to hardware/software partitioning for synchronous model. We formalize the partitioning problem using timed automata, which captures the key elements of the partitioning. Then the tabu algorithm is applied to timed automata model to search for the solution efficiently. An industrial experiment is conducted to show our approach can handle large applications with hundreds of nodes in task graph effectively","PeriodicalId":269321,"journal":{"name":"11th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126285371","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}