发布求助
文献互助 智能选刊 最新文献

Int. J. Crit. Comput. Based Syst.最新文献

筛选
英文 中文
A methodology for assuring the safety and security of critical infrastructure based on STPA and Event-B 一种基于STPA和Event-B的确保关键基础设施安全的方法
Int. J. Crit. Comput. Based Syst. Pub Date : 2019-03-19 DOI: 10.1504/ijccbs.2019.10020048
Giles Howard, M. Butler, J. Colley, V. Sassone
{"title":"A methodology for assuring the safety and security of critical infrastructure based on STPA and Event-B","authors":"Giles Howard, M. Butler, J. Colley, V. Sassone","doi":"10.1504/ijccbs.2019.10020048","DOIUrl":"https://doi.org/10.1504/ijccbs.2019.10020048","url":null,"abstract":"Cyber-physical systems represent a challenge to conventional security and safety analysis techniques due to their complexity and the need to consider both safety and security equally. It is also important that the requirements generated to mitigate against safety and security risks are clear and adequately address the underlying issue. A methodology is presented in this paper to allow for integrated safety and security analysis of cyber-physical systems, particularly in a critical infrastructure context. This methodology uses a modified form of STPA, which has been coupled with our concept of adversarial modelling, to analyse for security and safety hazards which are then mitigated against by the creation of critical requirements. These critical requirements are then validated through their application to an Event-B formal model, allowing for their completeness to be verified. The output of the methodology is a set of critical requirements that guide iteration of and improvements to the system design to ensure its safety and security are maintained.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133046817","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}
引用次数: 3
Multicore scheduling of real-time systems subject to permanent failure of one core with detection delay 具有检测延迟的单核永久故障实时系统的多核调度
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-12-04 DOI: 10.1504/IJCCBS.2018.10017707
Y. Tchinda, Annie Choquet-Geniet, Gaëlle Largeteau-Skapin
{"title":"Multicore scheduling of real-time systems subject to permanent failure of one core with detection delay","authors":"Y. Tchinda, Annie Choquet-Geniet, Gaëlle Largeteau-Skapin","doi":"10.1504/IJCCBS.2018.10017707","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10017707","url":null,"abstract":"This work addresses the failure tolerance of a multicore real-time application with a non negligible detection delay and lost execution recovery. We propose three techniques having different scopes of use. The first one (SST) guarantees the validity and the fairness of the result but uses a high number of additional cores. The second (CRT) provides a valid schedule with a single additional core but cannot manage any system since several constraints are imposed. The third method (AFT), which can be applied to any system, uses the idle time units to recover the lost execution. However, a bounded number of temporal faults should be accepted. The experimental results for SST and CRT show that 100% of the simulated systems have a valid schedule. As for AFT, in 87% of the cases the tasks recover before their deadlines and the recovery delay is bounded for the 13% other cases.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125753651","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}
引用次数: 1
Performance evaluation of stochastic real-time systems with the SBIP framework 基于ship框架的随机实时系统性能评估
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-12-04 DOI: 10.1504/IJCCBS.2018.10017703
Ayoub Nouri, B. Mediouni, M. Bozga, Jacques Combaz, S. Bensalem, Axel Legay
{"title":"Performance evaluation of stochastic real-time systems with the SBIP framework","authors":"Ayoub Nouri, B. Mediouni, M. Bozga, Jacques Combaz, S. Bensalem, Axel Legay","doi":"10.1504/IJCCBS.2018.10017703","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10017703","url":null,"abstract":"The SBIP framework consists of a stochastic real-time component-based modelling formalism and a statistical model checking engine. The former is built as a stochastic extension of the real-time BIP formalism and enables the construction of stochastic real-time systems in a compositional way. The statistical engine implements a set of statistical algorithms for the quantitative and qualitative assessment of probabilistic properties. The paper provides a thorough introduction to the SBIP formalism and the associated verification method. In a second part, it surveys several case studies about modelling and verification of real-life systems, including various network protocols and multimedia applications.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116261757","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}
引用次数: 22
A model-based approach to combine conformance and load tests: an eHealth case study 结合一致性和负载测试的基于模型的方法:电子健康案例研究
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-12-04 DOI: 10.1504/IJCCBS.2018.10017701
M. Krichen, Afef Jmal Maâlej, Mariam Lahami
{"title":"A model-based approach to combine conformance and load tests: an eHealth case study","authors":"M. Krichen, Afef Jmal Maâlej, Mariam Lahami","doi":"10.1504/IJCCBS.2018.10017701","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10017701","url":null,"abstract":"In this paper, we propose a new model-based framework that combines both conformance and load tests in the context of real-time systems. Our new framework is based on the model of extended timed automata with inputs/outputs and shared integer variables. In addition, we define a new extended timed input output conformance relation etioco. This latter allows to compare a given implementation with respect to its specifications considering load conditions. We also discuss some modelling issues and we provide a new technique for deriving analogue-clock tests from the specification of the system under test (SUT). In order to show the relevance of our approach, we report on a critical case study from the healthcare field. An important contribution in this work was to use a rich formalism to model multi-user systems and to combine conformance and load tests in the same model. This point constitutes an important testing area that is usually misunderstood.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134446146","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}
引用次数: 21
Precise use cases in a context-aware model-checking approach 上下文感知模型检查方法中的精确用例
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-12-04 DOI: 10.1504/ijccbs.2018.10017704
Amel Benabbou, S. N. Bahloul, P. Dhaussy
{"title":"Precise use cases in a context-aware model-checking approach","authors":"Amel Benabbou, S. N. Bahloul, P. Dhaussy","doi":"10.1504/ijccbs.2018.10017704","DOIUrl":"https://doi.org/10.1504/ijccbs.2018.10017704","url":null,"abstract":"Formal verification exhibits well known benefits but comes at the price of formalising precise and sound requirements, what often remains a challenging task for engineers. We propose a high-level formalism for expressing requirements based on interaction overview diagrams, which orchestrate activity diagrams that we automatically derived from use cases. Informal requirements are transformed into scenarios which fuel a context-aware model-checking approach. The approach assumes the availability of a formal model of the system, such as concurrent and communicating automata and a set of requirements specified in the form of contexts, which point out boundaries between the system and its environment. The requirement specification approach blends elaboration and transformation phases. Thanks to this blending, the semantic gap between informal and formal requirements is reduced, while model-checking is improved by contexts modelling. As a consequence, engineers gain support for moving towards formal verification.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134478982","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}
引用次数: 0
Performance analysis of the M/G/c/c + r queuing system for cloud computing data centres 云计算数据中心M/G/c/c + r排队系统的性能分析
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-12-04 DOI: 10.1504/IJCCBS.2018.096441
Assia Outamazirt, M. Escheikh, D. Aïssani, Kamel Barkaoui, Ouiza Lekadir
{"title":"Performance analysis of the M/G/c/c + r queuing system for cloud computing data centres","authors":"Assia Outamazirt, M. Escheikh, D. Aïssani, Kamel Barkaoui, Ouiza Lekadir","doi":"10.1504/IJCCBS.2018.096441","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.096441","url":null,"abstract":"In this paper, we propose M/G/c/c + r queuing system as a model for performance evaluation of cloud server farms. Analytical resolution of this queuing system remains, to this day, an open and challenging issue because an exact analytical solution is difficult to reach. Therefore, we provide new approximate formulas to compute the transition-probability matrix of this system. In order to examine the accuracy of our approximate formulas, we test them numerically on some examples. Then, we compute the steady-state probabilities and some performance indicators such as blocking probability, mean response time, probability of immediate service and delay probability.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116461774","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}
引用次数: 3
Formal probabilistic performance verification of randomly-scheduled wireless sensor networks 随机调度无线传感器网络的形式化概率性能验证
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-12-04 DOI: 10.1504/IJCCBS.2018.10017702
M. Elleuch, O. Hasan, S. Tahar, M. Abid
{"title":"Formal probabilistic performance verification of randomly-scheduled wireless sensor networks","authors":"M. Elleuch, O. Hasan, S. Tahar, M. Abid","doi":"10.1504/IJCCBS.2018.10017702","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10017702","url":null,"abstract":"Energy efficiency in wireless sensor networks (WSN) is one of the most critical issue regardless of the target application. While scheduling sensors by partitions to preserve energy is a simple and intuitive approach in this context, it is also important to not compromise on the main performance requirements of the considered application. For mission-critical WSN applications, different quality of service (QoS) requirements on network performance have to be met. Besides, various assumptions, may effectively impact the sensing performance capabilities of the network. Nevertheless, most analysis techniques focus on the average performance values, and do not consider neither the targeted QoS requirements, nor the probabilistic feature of the algorithm. Based on the theorem proving approach, we first provide, in this paper, an accurate formal analysis of the network lifetime maximisation problem, under QoS constraints, for randomly-scheduled wireless sensor networks. After that, we tackle the higher-order-logic formalisation of the intrusion coverage intensity, for a modified version of the randomised scheduling, with more realistic assumptions for the intrusion object, in a two or three dimensional plane.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130176444","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}
引用次数: 0
Fault diagnosis of discrete-event systems based on the symbolic observation graph 基于符号观测图的离散事件系统故障诊断
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-11-20 DOI: 10.1504/IJCCBS.2018.10011234
Abderraouf Boussif, M. Ghazel, Kais Klai
{"title":"Fault diagnosis of discrete-event systems based on the symbolic observation graph","authors":"Abderraouf Boussif, M. Ghazel, Kais Klai","doi":"10.1504/IJCCBS.2018.10011234","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10011234","url":null,"abstract":"Fault diagnosis of discrete-event systems (DESs) has received a lot of attention in industry and academia during the last two decades. In DES based diagnosis, the two main discussed topics are offline diagnosability analysis and online diagnosis. A pioneering approach that led to the development of various techniques is based on the so-called diagnose. However, this approach suffers from the combinatorial explosion problem due to the exponential complexity of construction. To partially overcome this problem, an efficient approach to construct a symbolic diagnoser is proposed in this paper. The proposed approach consists in constructing a diagnoser based on the symbolic observation graph (SOG), which combines symbolic and enumarative representations. The construction of the diagnoser as well as the verification of diagnosability are performed simultaneously on the fly, which can considerably reduce the state space of the diagnoser and thus the overall running time. To evaluate the efficiency and the scalability of the approach, some experimental results are presented and discussed based on a DES benchmark.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116732877","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}
引用次数: 6
A formal model for the analysis and verification of a pre-emptive round-robin arbiter 一个用于分析和验证先发制人的轮循仲裁器的形式化模型
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-11-20 DOI: 10.1504/IJCCBS.2018.10017380
Imene Ben Hafaiedh, Maroua Ben Slimane, R. Robbana
{"title":"A formal model for the analysis and verification of a pre-emptive round-robin arbiter","authors":"Imene Ben Hafaiedh, Maroua Ben Slimane, R. Robbana","doi":"10.1504/IJCCBS.2018.10017380","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10017380","url":null,"abstract":"Resource arbitration is a fundamental problem in communication and computing system design. Thus, a fast and efficient arbitration algorithm is one of the most dominant factors for high performance networks-on-chip (NoCs) and ensuring their reliability and performance is highly required. In this context, we propose, a formal model for the analysis and validation of the round-robin protocol, considered as the most widely adopted scheduling algorithm, in particular for real-time applications. The contribution of this paper is first to propose a high-level formal, distributed and scalable model for round-robin arbiter based on the formalism of timed automata. We then employ model checking, to verify a set of relevant properties of the round-robin protocol such as deadlock freedom and invariant. In order to evaluate the efficiency and the scalability of the protocol under study, a set of experimental results are presented based on an automatically generated code of our proposed model.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134405659","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}
引用次数: 1
Model-based specification and validation of the dual-mode adaptive MAC protocol 基于模型的双模自适应MAC协议规范与验证
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-11-20 DOI: 10.1504/IJCCBS.2018.10017375
A. Somappa, L. Kristensen, A. Prinz
{"title":"Model-based specification and validation of the dual-mode adaptive MAC protocol","authors":"A. Somappa, L. Kristensen, A. Prinz","doi":"10.1504/IJCCBS.2018.10017375","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10017375","url":null,"abstract":"Wireless sensor and actuator networks (WSANs) rely on MAC protocols to coordinate access to the wireless medium access and for managing the radio unit on each device. The dual-mode adaptive MAC (DMAMAC) protocol is a recently proposed protocol designed to reduce the energy consumption of the radio communication in WSANs. The DMAMAC protocol targets the industrial WSANs used for real-time process control. At its core, DMAMAC exploits the distinction between transient and steady of the controlled plant process to dynamically adapt the MAC superframe structure and thereby conserve energy. The switch between steady and transient mode of operation is a safety-critical part of the protocol. The contribution of this paper is to develop a rigorous specification of the DMAMAC protocol using timed automata and the supporting Uppaal software tool. The Uppaal tool is also used to verify key functional and real-time properties of the protocol. Finally, we have used execution sequences from the formal specification model to validate an OMNET simulation model used for performance evaluation of DMAMAC, and to validate a nesC implementation of the protocol on the TinyOS platform.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114739571","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书