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

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

筛选
英文 中文
The TTEthernet synchronisation protocols and their formal verification 以太网同步协议及其形式化验证
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-12-01 DOI: 10.1504/IJCCBS.2013.058398
W. Steiner, B. Dutertre
{"title":"The TTEthernet synchronisation protocols and their formal verification","authors":"W. Steiner, B. Dutertre","doi":"10.1504/IJCCBS.2013.058398","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.058398","url":null,"abstract":"TTEthernet is a communication platform for critical, distributed computer-based systems. NASA has selected one of TTEthernet%s high-end configurations for the Orion programme. In other configurations, TTEthernet implements the communication backbone of new energy machineries such as wind turbines. One of TTEthernet's unique features is the integration of applications with differing latency, jitter, and fault-tolerance requirements in a single physical Ethernet network, thereby significantly reducing the amount of wiring in a distributed system. The most critical applications can communicate using time-triggered messages for which a fault-tolerant high-precision network-wide timebase is required. Formal methods are key in the design of protocols that establish and maintain such a timebase and, thus, have been heavily used already during the design phase of TTEthernet. This paper summarises the formal analysis and verification activities of the TTEthernet synchronisation protocols and discusses protocol updates implemented in the TTEthernet standard SAE AS6802.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"46 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":"116570039","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}
引用次数: 16
Low-power test sets under test-related primary input constraints 在与测试相关的主输入约束下的低功耗测试集
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-12-01 DOI: 10.1504/IJCCBS.2013.058396
I. Pomeranz
{"title":"Low-power test sets under test-related primary input constraints","authors":"I. Pomeranz","doi":"10.1504/IJCCBS.2013.058396","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.058396","url":null,"abstract":"This paper considers the generation of low-power test sets under test-related primary input constraints. Such constraints are used for addressing tester limitations related to the application of tests at-speed. Specifically, the paper considers the switching activity which measures the power dissipation during the fast functional clock cycles of broadside tests with constrained primary input vectors. For a functional broadside test, the switching activity during the fast functional clock cycle is guaranteed not to exceed the switching activity possible during functional operation. Therefore, functional broadside tests are appropriate as low-power tests. In addition, the switching activity of functional broadside tests can be used for bounding the switching activity of other tests in a low-power test set. The paper observes that functional broadside tests for computing the bound should be generated under the same primary input constraint as the low-power test set. This is important since primary input constraints affect the switching activity possible in parts of the circuit that are influenced by the primary inputs. It helps ensure that the switching activity in other parts of the circuit will not be higher, or not be restricted to be lower, than during functional operation.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"1 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":"125778131","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
Towards spatial isolation design in a multi-core real-time kernel targeting safety-critical applications 面向安全关键应用的多核实时内核空间隔离设计
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-12-01 DOI: 10.1504/IJCCBS.2013.058402
Gang Li, Søren Top
{"title":"Towards spatial isolation design in a multi-core real-time kernel targeting safety-critical applications","authors":"Gang Li, Søren Top","doi":"10.1504/IJCCBS.2013.058402","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.058402","url":null,"abstract":"In mixed-criticality systems, applications naturally have different safety criticality levels. Partitioning technology is usually used to enable the integration of such mixed criticality applications upon one platform, aiming at reducing hardware, power consumption and especially certification cost. Partitioning can prevent fault propagation among mixed-criticality applications, if spatial and temporal isolation are adequately ensured. This paper focuses on the solution of spatial isolation in the HARTEX kernel on a multi-core platform in terms of memory, communication between applications and I/O sharing. According to formulated isolation requirements, a simple partitioning multi-core hardware architecture is proposed using SoC and memory protection units, and the kernel is extended to support spatial isolation between the kernel and applications as well as between applications. Combined design of hardware and software can easily achieve this isolation. At last, the spatial isolation is evaluated using a statistical sampling method and its performance is tested in terms of task switch, system call and footprint.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"33 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":"123032858","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
Hierarchical timed abstract state machines for WCET estimation WCET估计的分层时间抽象状态机
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-11-21 DOI: 10.1504/IJCCBS.2016.081810
V. Paun, B. Monsuez, P. Baufreton
{"title":"Hierarchical timed abstract state machines for WCET estimation","authors":"V. Paun, B. Monsuez, P. Baufreton","doi":"10.1504/IJCCBS.2016.081810","DOIUrl":"https://doi.org/10.1504/IJCCBS.2016.081810","url":null,"abstract":"In this paper, we present an extension of the abstract state machines suited for the modelling of complex processors in the context of system verification. Besides processor simulation, the goal of our model is to provide a base for worst-case execution time estimation, providing abstraction capabilities that enable the scaling of analysis. The main difference between our model and other ASM extensions is that we define time as a mean to enable time accurate runs and hierarchical abstraction levels of components, while staying the closest possible to the original ASM mathematical foundation. The model is also designed to dynamically choose a suited component definition in order to adapt to information precision on data values. The time extension helps modelling non-instantaneous actions, which is essential for real-time systems. Adaptable precision and separation of the analysis from the model of the processor will prove well suited for integration into a worst-case execution time estimation tool.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125275251","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
Hazard analysis of Unified Modelling Language sequence and state charts using software fault tree analysis 用软件故障树分析法对统一建模语言序列和状态图进行危害分析
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-09-25 DOI: 10.1504/IJCCBS.2013.056512
Pankaj Vyas, R. K. Mittal
{"title":"Hazard analysis of Unified Modelling Language sequence and state charts using software fault tree analysis","authors":"Pankaj Vyas, R. K. Mittal","doi":"10.1504/IJCCBS.2013.056512","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.056512","url":null,"abstract":"Software fault tree analysis (SFTA) is a well known software safety analysis technique for identifying those software related erroneous events which can force the system into a hazardous state. Over the years, the effective strengths of SFTA approach have been demonstrated by applying it practically at every phase of software development such as coding, design and requirement analysis. The focus of SFTA application research efforts at the software design phase is the automatic or semi-automatic construction of a software fault tree for the selected hazardous state of the system directly from the given Unified Modelling Language (UML) models such as sequence and state charts. But programmed application of SFTA has been successfully carried out so far only in the coding phase whereas at other phases especially at design and requirement analysis its application remains a manual process so far. This paper presents a semi-automated approach to construct a software fault tree from the UML sequence and state charts drawn for a particular functional scenario. The effective strength(s) of the proposed approach have been demonstrated by applying it on two use-case scenarios selected from an elevator controller application.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123207764","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
Optimal configuration of fault-tolerance parameters for distributed replicated server access 分布式复制服务器访问容错参数的优化配置
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-09-25 DOI: 10.1504/IJCCBS.2013.056493
Alessandro Daidone, T. Renier, A. Bondavalli, H. Schwefel
{"title":"Optimal configuration of fault-tolerance parameters for distributed replicated server access","authors":"Alessandro Daidone, T. Renier, A. Bondavalli, H. Schwefel","doi":"10.1504/IJCCBS.2013.056493","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.056493","url":null,"abstract":"Server replication is a common fault-tolerance strategy to improve transaction dependability for services in communications networks. In distributed architectures, fault-diagnosis and recovery are implemented via the interaction of the server replicas with the clients and other entities such as enhanced name servers. Such architectures provide an increased number of redundancy configuration choices. The influence of a (wide area) network connection can be quite significant and induce trade-offs between dependability and user-perceived performance. This paper develops a quantitative stochastic model using stochastic activity networks (SAN) for the evaluation of performance and dependability metrics of a generic transaction-based service implemented on a distributed replication architecture. The composite SAN model can be easily adapted to a wide range of client-server applications deployed in replicated server architectures. In order to obtain insight into the system behaviour, a set of relevant environment parameters and controllable fault-tolerance parameters are chosen and the dependability/performance trade-off is evaluated.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124416769","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
A survey of safety-oriented model-driven and formal development approaches 面向安全的模型驱动和正式开发方法的概述
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-09-25 DOI: 10.1504/IJCCBS.2013.056485
Y. Prokhorova, E. Troubitsyna
{"title":"A survey of safety-oriented model-driven and formal development approaches","authors":"Y. Prokhorova, E. Troubitsyna","doi":"10.1504/IJCCBS.2013.056485","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.056485","url":null,"abstract":"Numerous model-driven and formal approaches have been proposed to facilitate development of complex critical systems. To address safety concerns, these approaches incorporate safety analysis techniques at different stages of the system development process. In this paper, we overview the approaches that have been recently proposed to integrate safety analysis into model-driven and formal development of critical systems. Moreover, we identify several criteria for classifying and comparing these approaches. Our survey aims at guiding industry practitioners as well as identifying promising research directions in the area.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123969994","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
Probabilistic fault tree synthesis using causality computation 基于因果计算的概率故障树综合
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-09-25 DOI: 10.1504/IJCCBS.2013.056492
Florian Leitner-Fischer, S. Leue
{"title":"Probabilistic fault tree synthesis using causality computation","authors":"Florian Leitner-Fischer, S. Leue","doi":"10.1504/IJCCBS.2013.056492","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.056492","url":null,"abstract":"In recent years, several approaches to generate probabilistic counterexamples have been proposed. The interpretation of probabilistic counterexamples, however, continues to be problematic since they have to be represented as sets of paths, and the number of paths in this set may be very large. Fault trees (FTs) are a well-established industrial technique to represent causalities for possible system hazards resulting from system or system component failures. In this paper, we extend the structural equation approach by Pearl and Halpern, which is based on Lewis counterfactuals, so that it can be applied to reason about causalities in a state-action trace model induced by a probabilistic counterexample. The causality relationships derived by the extended structural equation model are then mapped onto fault trees. We demonstrate the usefulness of our approach by applying it to a selection of case studies known from literature.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130099866","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}
引用次数: 38
Dynamic allocation and admission policies for QoS-aware provisioning systems qos感知供应系统的动态分配和准入策略
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-05-08 DOI: 10.1504/IJCCBS.2013.053741
M. Mazzucco, M. Mazzara, N. Dragoni
{"title":"Dynamic allocation and admission policies for QoS-aware provisioning systems","authors":"M. Mazzucco, M. Mazzara, N. Dragoni","doi":"10.1504/IJCCBS.2013.053741","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.053741","url":null,"abstract":"We present an architecture of a hosting system consisting of a set of hosted web services subject to QoS constraints, and a certain number of servers used to run user’s demand. The traffic is session-based, while provider and users agree on SLAs specifying the expected level of service performance such that the service provider is liable to compensate his/her customers if the level of performance is not satisfactory. The system is driven by a utility function which tries to optimise the average earned revenue per unit time. The middleware collects demand and performance statistics, and estimates traffic parameters in order to make dynamic decisions concerning server allocation and admission control. We empirically evaluate the effects of admission policies, resource allocation and service differentiation schemes on the achieved revenues, and we find that our system is robust enough to successfully deal with session-based traffic under different conditions.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114119423","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
A refinement-based approach to developing critical multi-agent systems 一种基于改进的关键多智能体系统开发方法
Int. J. Crit. Comput. Based Syst. Pub Date : 2013-05-08 DOI: 10.1504/IJCCBS.2013.053743
Inna Pereverzeva, E. Troubitsyna, L. Laibinis
{"title":"A refinement-based approach to developing critical multi-agent systems","authors":"Inna Pereverzeva, E. Troubitsyna, L. Laibinis","doi":"10.1504/IJCCBS.2013.053743","DOIUrl":"https://doi.org/10.1504/IJCCBS.2013.053743","url":null,"abstract":"Multi-agent systems are increasingly used in critical applications. To ensure dependability of multi-agent systems, we need powerful development techniques that would allow us to master complexity inherent to such kind of systems and formally verify correctness and safety of collaborative agent activities. In this paper, we present a rigorous approach to the development and verification of critical multi-agent system in Event-B. We demonstrate how to formally specify complex agent interactions and verify their correctness and safety. We argue that the refinement approach facilitates structuring complex requirements and formal reasoning about system-level properties. We illustrate our approach by a case study: formal development of a hospital multi-agent system.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"46 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129367724","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}
引用次数: 12
首页 上一页 下一页 尾页
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学术官方微信
小红书