Architectural concurrency equivalence with chaotic models

被引:1
|
作者
de Niz, Dionisio [1 ]
机构
[1] Carnegie Mellon Univ, Inst Software Engn, Pittsburgh, PA 15213 USA
关键词
D O I
10.1109/MOMPES.2008.10
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
During its lifetime, embedded systems go through multiple changes to their runtime architecture. That is, threads, processes, and processor are added or removed to/from the software and hardware. These additions can have multiple motivations such as adding tolerance to failures or changes in the hardware architecture for new releases of the system. During these modifications, one of the big challenges is ensuring that no new error is introduced. This verification tends to be difficult given that modifying the concurrency structure of an application has multiple side effects difficult to discover In. this paper we propose a model-based technique to compare the concurrency structures of two architectural models. This exhaustive comparison is based on the semantics of AADL, an architecture description language, and its model in Alloy, a formal verification language. This verification guides the designer to fully, define the desired behaviors as well as the side effects that can be tolerated. We demonstrate the use of the modeling with a simple model from the automotive industry.
引用
收藏
页码:57 / 67
页数:11
相关论文
共 50 条
  • [1] Concurrency bisimulation for models in concurrency
    Nielsen, M
    Clausen, C
    CONCUR '94: CONCURRENCY THEORY, 1994, 836 : 385 - 400
  • [2] MODELS FOR CONCURRENCY
    NIELSEN, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 520 : 43 - 46
  • [3] ON AN EQUIVALENCE OF CHAOTIC ATTRACTORS
    KOCAREV, L
    KAPITANIAK, T
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1995, 28 (09): : L249 - L254
  • [4] Presheaf models for concurrency
    Cattani, GL
    Winskel, G
    COMPUTER SCIENCE LOGIC, 1997, 1258 : 58 - 75
  • [5] Simplicial Models for Concurrency
    Bubenik, Peter
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2012, 283 : 3 - 12
  • [6] Reversibility and Models for Concurrency
    Phillips, Iain
    Ulidowski, Irek
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 192 (01) : 93 - 108
  • [7] CATEGORIES OF MODELS FOR CONCURRENCY
    WINSKEL, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 197 : 246 - 267
  • [8] OmniBroker concurrency models
    Laukien, M
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 1404 - 1409
  • [9] Context for Models of Concurrency
    Bubenik, Peter
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 230 (0C) : 3 - 21
  • [10] On the equivalence of four chaotic operators
    Wu, Xinxing
    Zhu, Peiyong
    APPLIED MATHEMATICS LETTERS, 2012, 25 (03) : 545 - 549