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

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

筛选
英文 中文
Using temporal logics for specifying weak memory consistency models 使用时间逻辑指定弱内存一致性模型
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-11-20 DOI: 10.1504/IJCCBS.2018.10017374
Maximilian Senftleben, K. Schneider
{"title":"Using temporal logics for specifying weak memory consistency models","authors":"Maximilian Senftleben, K. Schneider","doi":"10.1504/IJCCBS.2018.10017374","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10017374","url":null,"abstract":"The formal verification of multithreaded programs is not just more difficult due to the concurrent behaviours, but also due to the used underlying weak memory consistency models. Weak memory models arise from techniques like store buffering that were introduced to increase the performance. However, all of these techniques weaken the memory consistency, and may result in unintuitive behaviours where processors may disagree on the order in which write operations occurred. Requirements for verification are therefore unambiguous and complete specifications of such memory consistency models. In the past, specifications based on different formalisms have been presented which often lacked of comparability and the direct usability for model checking. In this paper, we therefore introduce the use of temporal logic to describe the behaviour of memory systems. In particular, we use linear temporal logic (LTL) to define the weak memory models. Thereby, we can easily check the properties of a multithreaded program against several different consistency models and determine the weakest consistency guarantees required to fulfil the given specification.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"15 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":"127657659","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
Formal verification of intermittent fault diagnosability of discrete-event systems using model-checking 离散事件系统间歇故障可诊断性的模型检验
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-11-20 DOI: 10.1504/IJCCBS.2018.10017377
Abderraouf Boussif, M. Ghazel
{"title":"Formal verification of intermittent fault diagnosability of discrete-event systems using model-checking","authors":"Abderraouf Boussif, M. Ghazel","doi":"10.1504/IJCCBS.2018.10017377","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10017377","url":null,"abstract":"Fault diagnosis of complex and dynamic systems is a crucial and challenging task, essentially with respect to guaranteeing the reliable, safe and efficient operation of such systems. Most research in this field has been focused on permanent failure diagnosis, i.e., once a fault occurs, the system remains indefinitely faulty. However, experience with fault diagnosis in real-life systems shows that intermittent faults, i.e., faults that can be automatically recovered, are predominant and are among the most challenging kinds of faults to detect and isolate. In this paper, we address the formal verification of intermittent fault diagnosability in discrete-event systems. The system is modelled by a finite state automaton and intermittent faults are defined as faults that can automatically recover once they have occurred. Two definitions of diagnosability, regarding the detection of fault occurrence within a finite delay and the detection of fault occurrence before its recovery, are discussed. The diagnosability is analysed on the basis of the twin-plant structure, which is encoded as a Kripke structure, while diagnosability conditions are formulated using LTL temporal logic.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"11 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":"123743801","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
On context-independent and context-aware cloud services substitutability verification 关于上下文独立和上下文感知的云服务可替代性验证
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-05-22 DOI: 10.1504/IJCCBS.2018.10013032
Sofiane Bourouz, N. Zeghib
{"title":"On context-independent and context-aware cloud services substitutability verification","authors":"Sofiane Bourouz, N. Zeghib","doi":"10.1504/IJCCBS.2018.10013032","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10013032","url":null,"abstract":"The composition of web services in cloud computing allows making them cooperative in order to satisfy a client request. However, the substitution of one of these services by another must ensure the proper functioning of the new composition. Hence there is a need to develop adequate methods to verify the services substitution. In this aim, we propose, in the present paper, two verification methods. The first one deals with context-independent substitution and sets if a web service can substitute another one. The second one focuses on context-aware substitution and decides the substitutability of web services in a specific composition. These methods use open coloured Petri net (OCNets) as a formal framework for modelling web services and their composition in cloud computing. This model allows the structural analysis of web services' interfaces. For the behavioural verification, we use services automata, which allow capturing OCNets' behaviour and checking its preservation.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116619913","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
µQC: a property-based testing framework for L4 microkernels µQC:一个基于属性的L4微内核测试框架
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-05-22 DOI: 10.1504/IJCCBS.2018.10013023
Cosmin Dragomir, Lucian Mogosanu, M. Cărăbaş, Răzvan Deaconescu, N. Tapus
{"title":"µQC: a property-based testing framework for L4 microkernels","authors":"Cosmin Dragomir, Lucian Mogosanu, M. Cărăbaş, Răzvan Deaconescu, N. Tapus","doi":"10.1504/IJCCBS.2018.10013023","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10013023","url":null,"abstract":"As the complexity of software is increasing, traditional testing methods are unable to provide a high level of assurance for critical software systems, particularly operating system kernels, which represent the root of trust in computing systems. At the same time, formal verification is costly and difficult even for small system software such as microkernels, which are relied on for applications with high security and/or safety requirements, e.g., automotive and cellular radio. Our work closes a trade-off between the strong guarantees of formal verification and the flexibility of traditional software testing methods such as unit testing. We argue that this trade-off can be readily closed by property-based testing. In this paper we present µQC, a property-based testing framework for L4 microkernels. We illustrate our prototype by evaluating a significant subset of the L4 API (threading and scheduling) starting from its specification.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115844100","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
Extending GSPNs for the modelling, analysis and performance evaluation of dynamic systems 扩展GSPNs用于动态系统的建模、分析和性能评估
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-05-22 DOI: 10.1504/IJCCBS.2018.10013031
Samir Tigane, L. Kahloul, Samir Bourekkache, S. Baarir
{"title":"Extending GSPNs for the modelling, analysis and performance evaluation of dynamic systems","authors":"Samir Tigane, L. Kahloul, Samir Bourekkache, S. Baarir","doi":"10.1504/IJCCBS.2018.10013031","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10013031","url":null,"abstract":"Cloud-based systems are open systems where resources are theoretically non-limited and the number of connected users/devices varies all the time. These systems are close to dynamic systems where the structure changes at runtime. The objective of this paper is to present a new formalism 'extended generalised stochastic Petri nets (EGSPNs)' dedicated to model, analyse and evaluate the performance of reconfigurable systems. In its basic form, GSPNs extend Petri nets by introducing stochastic time. In this paper, GSPNs are enriched with a set of mechanisms allowing the reconfigurability of their structure at runtime. The new formalism 'EGSPNs' is applied to model, analyse and evaluate the performance of a case study.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129478123","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
Diagnosability analysis and fault diagnosis of P-time labelled Petri nets p -时间标记Petri网的可诊断性分析与故障诊断
Int. J. Crit. Comput. Based Syst. Pub Date : 2018-05-22 DOI: 10.1504/IJCCBS.2018.10013034
P. Bonhomme
{"title":"Diagnosability analysis and fault diagnosis of P-time labelled Petri nets","authors":"P. Bonhomme","doi":"10.1504/IJCCBS.2018.10013034","DOIUrl":"https://doi.org/10.1504/IJCCBS.2018.10013034","url":null,"abstract":"This paper addresses the problem of analysing the diagnosability of a P-time labelled Petri net with partial information. Indeed, the set of transitions is partitioned into those labelled with the empty string e called silent (as their firing cannot be detected) including the faulty transitions and the observable ones. The diagnosability can be defined as the ability to detect the type of a failure within a finite number of steps after its occurrence - the system is then said to be diagnosable. The proposed approach is based on the synthesis of a modified state observer where the fault transitions are considered as observable allowing the construction of a sampath-like diagnoser. The novelty of the developed approach resides in the fact that, although the time factor is considered as intervals, the diagnoser is computed thanks to the underlying untimed Petri net structure of the P-time labelled model considered. Furthermore, the method relies on linear programming techniques and the schedulability analysis of particular firing sequences exhibited by the analysis of the obtained diagnoser and does not require the building of the state class graph.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128896790","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
Smart homes IoT techniques for dynamic provision of cloud benefactors 智能家居物联网技术为动态提供云服务
Int. J. Crit. Comput. Based Syst. Pub Date : 2017-12-07 DOI: 10.1504/IJCCBS.2017.10009395
P. Sanjeevi, P. Viswanathan
{"title":"Smart homes IoT techniques for dynamic provision of cloud benefactors","authors":"P. Sanjeevi, P. Viswanathan","doi":"10.1504/IJCCBS.2017.10009395","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.10009395","url":null,"abstract":"Present years have realised the expansion of computing settings for internet of things (IoTs) amenities, which switch huge amounts of data using several devices that are continuously associated to networks. Since the information communication and amenities arise on an assortment of devices, such as household appliances, embedded devices, and sensor nodes, the dynamic provision of IoT cloud benefactors' necessities are progressively important at this juncture. This work is based on IoT for home automation which is a collection of sensors controlled by microcontroller. Through microcontroller, we direct data to the cloud server for sharing the sensor data to the cloud server and accessed through mobile app. We used cloud server as Ubidots for monitoring the sensors like gas, flame, sound, and temperature. The main inspiration of this work is to alert communication through smartphone and e-mail on any abnormal constraint. This work is intended to decrease data transmit, decrease time, cost operative and easy to use.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125587634","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}
引用次数: 9
Verification of distributed systems involving bounded-time migration 涉及有界时间迁移的分布式系统的验证
Int. J. Crit. Comput. Based Syst. Pub Date : 2017-12-07 DOI: 10.1504/IJCCBS.2017.10009410
Bogdan Aman, Gabriel Ciobanu
{"title":"Verification of distributed systems involving bounded-time migration","authors":"Bogdan Aman, Gabriel Ciobanu","doi":"10.1504/IJCCBS.2017.10009410","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.10009410","url":null,"abstract":"We introduce and study a prototyping language for real-time distributed systems involving bounded-time migration and communication. The time constraints of this language are expressed as bounded intervals given by real numbers used to model faithfully the uncertainty of the delay in migration and communication of processes placed at explicit locations of a distributed system. We provide the operational semantics of this language and illustrate the new language by an example. Due to a translation of the bounded real-time distributed systems described in rTIMO into a network of timed safety automata, we can use an existing software tool for analysing their qualitative and quantitative properties.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125470024","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
Analysing timed compatibility of web service choreography 分析web服务编排的时间兼容性
Int. J. Crit. Comput. Based Syst. Pub Date : 2017-12-07 DOI: 10.1504/IJCCBS.2017.10009398
M. Benabdelhafid, B. Bérard, Mahmoud Boufaïda
{"title":"Analysing timed compatibility of web service choreography","authors":"M. Benabdelhafid, B. Bérard, Mahmoud Boufaïda","doi":"10.1504/IJCCBS.2017.10009398","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.10009398","url":null,"abstract":"Web services has become the most mature implementation of the service oriented computing (SOC) paradigm. The verification of behavioural compatibility is then necessary to ensure correct composition of services, which depends not only on qualitative properties such as absence of deadlock but also on some quantitative properties related to performance. Most of the proposed approaches verify the composition in service orchestration modelling. However, service choreography is more collaborative in nature and describes direct interactions between services. Although many existing approaches use Petri nets (PNs) and Colored PNs (CPNs) to analyse behavioural compatibility, few of them explore time constraints. We propose to model service interactions in a choreography with timed CPNs and perform automatic verification and simulation using CPN tools. We evaluate our approach with a case study from the Algerian e-Government, where we show how to verify global time constraints for the renewal of biometric passports.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124465515","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 a novel redundancy method for videoconferencing traffic in MPLS networks 一种新的MPLS网络视频会议业务冗余方法的性能评估
Int. J. Crit. Comput. Based Syst. Pub Date : 2017-12-07 DOI: 10.1504/IJCCBS.2017.10009396
M. Chaitou
{"title":"Performance evaluation of a novel redundancy method for videoconferencing traffic in MPLS networks","authors":"M. Chaitou","doi":"10.1504/IJCCBS.2017.10009396","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.10009396","url":null,"abstract":"Performance evaluation of computer networks using mathematical modelling is widely used in assessing the advantages and drawbacks of any new mechanism before its deployment. In this contribution, we introduce a new mechanism that aims at rerouting multi-point to multi-point (MP2MP) traffic such as videoconferencing in multi-protocol label switching-traffic engineering (MPLS-TE) networks. Then we develop a stochastic model in order to evaluate the amelioration incurred by our proposal compared to the existing approaches. In particular, we assess two criterions: the scalability and bandwidth efficiency. Our results show that our proposed method leads to better scalability while reducing the ratio of bandwidth wastage such as traffic duplication observed in the existing mechanisms. Our proposed rerouting mechanism contains two parts. First, we define the concept of MP2MP TE tunnel in MPLS as opposed to the existing MP2MP connectionless tunnel (i.e., without support of TE features such as bandwidth reservation and fast reroute in case of link and/or node failure). Second, we explain how to build a MP2MP TE bypass tunnel that is how to encapsulate a primary MP2MP TE tunnel into a backup MP2MP TE tunnel in order to provide the fast redundancy feature.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121577099","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学术官方微信
小红书