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

筛选
英文 中文
Size analysis in multiprocessor real-time scheduling 多处理器实时调度中的大小分析
Int. J. Crit. Comput. Based Syst. Pub Date : 2014-09-01 DOI: 10.1504/IJCCBS.2014.064664
Annie Choquet-Geniet, Gaëlle Largeteau-Skapin
{"title":"Size analysis in multiprocessor real-time scheduling","authors":"Annie Choquet-Geniet, Gaëlle Largeteau-Skapin","doi":"10.1504/IJCCBS.2014.064664","DOIUrl":"https://doi.org/10.1504/IJCCBS.2014.064664","url":null,"abstract":"If timeliness is a strong requirement for real-time applications, the reduction of weight and of the energy consumption are also important concerns. Besides, the actual trend is towards multiprocessor platforms. Thus we are interested in the determination of the lowest number of processors for a real-time system. For that aim, we use a model-driven approach, based on a geometrical modelling, and the matrix calculus in the dioid (N","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132747737","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}
引用次数: 2
On combining the ready sets with the covering steps methods 论准备集与覆盖步骤相结合的方法
Int. J. Crit. Comput. Based Syst. Pub Date : 2014-03-01 DOI: 10.1504/IJCCBS.2014.059591
H. Boucheneb, Kamel Barkaoui
{"title":"On combining the ready sets with the covering steps methods","authors":"H. Boucheneb, Kamel Barkaoui","doi":"10.1504/IJCCBS.2014.059591","DOIUrl":"https://doi.org/10.1504/IJCCBS.2014.059591","url":null,"abstract":"We consider here time Petri nets and the covering steps graph technique proposed by Vernadat et al. for untimed Petri nets. In this technique, some transitions are put together to be fired in a single transition step. This paper investigates how this technique can be extended to be applied to time Petri nets. It establishes some sufficient conditions useful to construct covering steps graphs preserving LTL","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123735936","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}
引用次数: 2
Managing energy in a network of reconfigurable optical add/drop multiplexers 可重构光加/丢多路复用器网络中的能量管理
Int. J. Crit. Comput. Based Syst. Pub Date : 2014-03-01 DOI: 10.1504/IJCCBS.2014.059595
J. Fourneau, N. Izri, D. Verchère
{"title":"Managing energy in a network of reconfigurable optical add/drop multiplexers","authors":"J. Fourneau, N. Izri, D. Verchère","doi":"10.1504/IJCCBS.2014.059595","DOIUrl":"https://doi.org/10.1504/IJCCBS.2014.059595","url":null,"abstract":"We show how to improve the energy consumption in an all optical ring network based on reconfigurable optical add and drop multiplexers ROADM in the following. The analysis is based on numerical analysis of discrete time Markov chains and some heuristics to design an efficient network configuration. We also present a software tool built to perform this performance analysis.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129423771","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
Strong and weak stochastic bounds for multidimensional Markov chains 多维马尔可夫链的强、弱随机界
Int. J. Crit. Comput. Based Syst. Pub Date : 2014-03-01 DOI: 10.1504/IJCCBS.2014.059592
Hind Castel-Taleb, N. Pekergin
{"title":"Strong and weak stochastic bounds for multidimensional Markov chains","authors":"Hind Castel-Taleb, N. Pekergin","doi":"10.1504/IJCCBS.2014.059592","DOIUrl":"https://doi.org/10.1504/IJCCBS.2014.059592","url":null,"abstract":"We study queueing networks similar to Jackson networks, modelled by a multidimensional Markov chain. The performance analysis may be very difficult or intractable, if there is no specific solution form. We explain how stochastic comparisons of Markov chains can be used to overcome this problem. We build new queueing which are easier to analyse and providing stochastic bounds upper or lower for the original model. In this paper, we propose different queueing systems in the sense of the strong and weak stochastic ordering for a general queueing network model in order to compute performance measure bounds as blocking probabilities. We discuss the accuracy of the bounds under different input parameter values.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114797982","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
Verifying while loops with invariant relations 验证具有不变关系的while循环
Int. J. Crit. Comput. Based Syst. Pub Date : 2014-03-01 DOI: 10.1504/IJCCBS.2014.059596
Asma Louhichi, Wided Ghardallou, K. Bsaïes, L. L. Jilani, Olfa Mraihi, A. Mili
{"title":"Verifying while loops with invariant relations","authors":"Asma Louhichi, Wided Ghardallou, K. Bsaïes, L. L. Jilani, Olfa Mraihi, A. Mili","doi":"10.1504/IJCCBS.2014.059596","DOIUrl":"https://doi.org/10.1504/IJCCBS.2014.059596","url":null,"abstract":"Traditionally, invariant assertions are used to verify the partial correctness of while loops with respect to pre/post specifications. In this paper we discuss a related but distinct concept, namely invariant relations, and show how invariant relations are a more potent tool in the analysis of while loops: whereas invariant assertions can only be used to prove partial correctness, invariant relations can be used to prove total correctness; also, whereas invariant assertions can only be used to prove correctness, invariant relations can be used to prove correctness and can also be used to prove incorrectness; finally, where traditional studies of loop termination equate termination with iterating a finite number of times, we broaden the definition of termination to also capture the condition that each individual iteration proceeds without raising an exception.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127258974","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
LTL translation improvements in Spot 1.0 Spot 1.0中LTL翻译的改进
Int. J. Crit. Comput. Based Syst. Pub Date : 2014-03-01 DOI: 10.1504/IJCCBS.2014.059594
A. Duret-Lutz
{"title":"LTL translation improvements in Spot 1.0","authors":"A. Duret-Lutz","doi":"10.1504/IJCCBS.2014.059594","DOIUrl":"https://doi.org/10.1504/IJCCBS.2014.059594","url":null,"abstract":"Spot is a library of model-checking algorithms started in 2003. This paper focuses on its module for translating linear-time temporal logic LTL formulas into Buchi automata: one of the steps required in the automata-theoretic approach to LTL model-checking. We detail the different algorithms involved in this translation: the core translation itself, which performs many simplifications thanks to its use of binary decision diagrams; the pre-processing of the LTL formulas with rewriting rules chosen to help their translation; and various post-processing algorithms whose use depends on the intent of the translation: do we favour deterministic automata, or small automata? Using different benchmarks, we show how Spot competes with other LTL translators, and how it has improved over the years.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132818872","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}
引用次数: 35
A formal framework to specify and verify real-time properties on critical systems 一个正式的框架,用于指定和验证关键系统的实时属性
Int. J. Crit. Comput. Based Syst. Pub Date : 2014-03-01 DOI: 10.1504/IJCCBS.2014.059593
Nouha Abid, Silvano Dal-Zilio, Didier Le Botlan
{"title":"A formal framework to specify and verify real-time properties on critical systems","authors":"Nouha Abid, Silvano Dal-Zilio, Didier Le Botlan","doi":"10.1504/IJCCBS.2014.059593","DOIUrl":"https://doi.org/10.1504/IJCCBS.2014.059593","url":null,"abstract":"We propose a verified approach to the formal verification of timed properties using model-checking techniques. We focus on properties commonly found during the analysis of reactive systems, expressed using real-time specification patterns. We use observers in order to transform the verification of these timed patterns into the verification of simpler LTL formulas. While the use of observers for model-checking is quite common, our contribution is original in several ways. First, we define a formal framework to verify that observers are correct and non-intrusive. Second, we define different classes of observers for each pattern and use a pragmatic approach in order to select the most efficient candidate in practice. This approach is implemented in an integrated verification tool chain for the Fiacre language.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134549316","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}
引用次数: 19
A RT-Maude-based framework for component installation 用于组件安装的基于rt - mode的框架
Int. J. Crit. Comput. Based Syst. Pub Date : 2014-03-01 DOI: 10.1504/IJCCBS.2014.059590
Meriem Belguidoum, F. Belala, F. Latreche
{"title":"A RT-Maude-based framework for component installation","authors":"Meriem Belguidoum, F. Belala, F. Latreche","doi":"10.1504/IJCCBS.2014.059590","DOIUrl":"https://doi.org/10.1504/IJCCBS.2014.059590","url":null,"abstract":"Real-time systems are considered in most cases as critical systems because they must strictly satisfy expected requirements in respect to giving timing constraints. The best way to develop and deploy these complex systems is the component-based software engineering. Traditionally, software components are developed independently and often considered as black boxes. However, they might be dependent from each other at assembly and deployment stages and used by a third party in various environments. In a previous work Belguidoum et al., 2011, we have proposed a Maude-based framework for safe component installation. In this paper, we extend this work by taking into account real-time constraints for installation operation. This framework is implemented using Real-Time Maude system enabling both the real-time installation execution and its formal analysis using its LTL model checker.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130168626","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
Efficient online memory error assessment and circumvention for Linux with RAMpage 有效的在线内存错误评估和规避Linux与RAMpage
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-12-01 DOI: 10.1504/IJCCBS.2013.058397
Horst Schirmeier, Ingo Korb, O. Spinczyk, M. Engel
{"title":"Efficient online memory error assessment and circumvention for Linux with RAMpage","authors":"Horst Schirmeier, Ingo Korb, O. Spinczyk, M. Engel","doi":"10.1504/IJCCBS.2013.058397","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.058397","url":null,"abstract":"Memory errors are a major source of reliability problems in computer systems. Undetected errors may result in program termination or, even worse, silent data corruption. Recent studies have shown that the frequency of permanent memory errors is an order of magnitude higher than previously assumed and regularly affects everyday operation. To reduce the impact of memory errors, we designed RAMpage, a purely software-based infrastructure to assess and circumvent permanent memory errors in a running commodity x86-64 Linux-based system. We briefly describe the design and implementation of RAMpage and present new results from an extensive qualitative and quantitative evaluation. These results show the efficiency of our approach - RAMpage is able to provide a smooth graceful degradation in the presence of permanent memory errors while requiring only a small overhead in terms of CPU time, energy, and memory space.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132607800","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
Interactive cockpits as critical applications: a model-based and a fault-tolerant approach 作为关键应用程序的交互式驾驶舱:基于模型和容错方法
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-12-01 DOI: 10.1504/IJCCBS.2013.058407
Camille Fayollas, J. Fabre, Philippe A. Palanque, Eric Barboni, D. Navarre, Y. Déléris
{"title":"Interactive cockpits as critical applications: a model-based and a fault-tolerant approach","authors":"Camille Fayollas, J. Fabre, Philippe A. Palanque, Eric Barboni, D. Navarre, Y. Déléris","doi":"10.1504/IJCCBS.2013.058407","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.058407","url":null,"abstract":"The deployment of higher interactivity in avionic digital cockpits for critical applications is a challenge today both in terms of software engineering and fault-tolerance. The dependability of the user interface and its related supporting software must be consistent with the criticality of the functions to be controlled. The approach proposed in this paper combines fault prevention and fault-tolerance techniques to address this challenge. Following the ARINC 661 standard, a model-based development of interactive objects namely widgets and layers aims at providing zero-defect software. Regarding remaining software faults in the underlying runtime support and also physical faults, the approach is based on fault tolerance design patterns, like self-checking components and replication techniques. The proposed solution relies on the space and time partitioning provided by the executive support following the ARINC 653 standard. Defining and designing resilient interactive cockpits is a necessity in the near future as these command and control systems provide a great opportunity to improve maintenance, evolvability and usability of avionic systems.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132430307","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}
引用次数: 13
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学术官方微信
小红书