Schedulability analysis of AADL models

Sokolsky,; Lee, Myeong Soo; Clarke,

doi:10.1109/ipdps.2006.1639421

Cited by 51 publications

(28 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, Ocarina can be easily integrated as a backend for other AADL editors (already used through OSATE and AADL Inspector tools), which increases the visibility of our work. AADL Formal approaches are often based on model transformation into different languages such as Lustre [13], TLA+ [22], Signal [5], ACSR [24], TASM [25], Fiacre [4], Real-time Maude [20] and BIP [8]. As examples: many work [5,26] are around the Polychrony platform and Signal language for synchronous verification of AADL models where behavior is specified by BA or Simulink.…”

Section: Related Workmentioning

confidence: 99%

An ocarina extension for AADL formal semantics generation

Mkaouar

Zalila

Hugues

et al. 2018

Proceedings of the 33rd Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

The formal verification has become a recommended practice in safety-critical software engineering. The hand-written of the formal specification requires a formal expertise and may become complex especially with large systems. In such context, the automatic generation of the formal specification seems helpful and rewarding, particularly for reused and generic mapping such as hardware representations and real-time features. In this paper, we aim to formally verify real-time systems designed by AADL language. We propose an extension AADL2LNT of the Ocarina tool suite allowing the automatic generation of an LNT specification to draw a gateway for the CADP formal analysis toolbox. This work is illustrated with the Pacemaker case study.

show abstract

Section: Related Workmentioning

confidence: 99%

An ocarina extension for AADL formal semantics generation

Mkaouar

Zalila

Hugues

et al. 2018

Proceedings of the 33rd Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…The translation proposed by Sokolsky et al (2006) mainly focus on the schedulability analysis of AADL models, a smaller subset (modes and the behavior annex are excluded) is translated into the real-time process algebra ACSR, and use the ACSR-based tool VERSA to explore the state space of the model, looking for violations of timing requirements. ACSR can express the notation of resource explicit in system models.…”

Section: Aadl Model Transformationsmentioning

confidence: 99%

“…When described using an AADL model, such a system specification is often transformed to another formal model for verification and analysis. Examples of such transformations are numerous: translations to Behavior Interaction Priority (BIP) (Chkouri et al, 2008), to TLA+ (Rolland et al, 2008), to real-time process algebra ACSR (Sokolsky et al, 2006), to IF (Abdoul et al, 2008), to Fiacre (Berthomieu et al, 2009), to Real-Time Maude (Ölveczky et al, 2010), to Lustre (Jahier et al, 2007), to Polychrony , etc. The goal of such a translation is to reuse existing verification and analysis tools and their formal model of computation and communication for the purpose of validating the AADL models.…”

mentioning

confidence: 99%

From AADL to Timed Abstract State Machines: A verified model transformation

Yang¹,

Hu²,

Ma³

et al. 2014

Journal of Systems and Software

View full text Add to dashboard Cite

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. This is an author-deposited version published in : http://oatao.univ-toulouse.fr/ Eprints ID : 12950 To verify and analyze the AADL models, model transformation technologies are often used to automatically extract a formal specification suitable for analysis and verification. In this process, it remains a challenge to prove that the model transformation preserves the semantics of the initial AADL model or, at least, some of the specific properties or requirements it needs to satisfy. This paper presents a machine checked semantics-preserving transformation of a subset of AADL (including periodic threads, data port communications, mode changes, and the AADL behavior annex) into Timed Abstract State Machines (TASM). The AADL standard itself lacks at present a formal semantics to make this translation validation possible. Our contribution is to bridge this gap by providing two formal semantics for the subset of AADL. The execution semantics provided by the AADL standard is formalized as Timed Transition Systems (TTS). This formalization gives a reference expression of AADL semantics which can be compared with the TASM-based translation (for verification purpose). Finally, the verified transformation is mechanized in the theorem prover Coq.

show abstract

“…AADL is used to design and analyze software and hardware architectures of embedded real-time systems. Many tools provide support for AADL: Ocarina implements Ada and C code generators for distributed systems [10], TOPCASED, OSATE and Stood provide AADL modeling features [5,3,22], the Fremont toolset and Cheddar implement AADL performance analysis methods [26,25]. An updated list of supporting tools can be found on the official AADL web site http://www.aadl.info.…”

Section: Example Of the Synchronous Data Flows Design-patternmentioning

confidence: 99%

Enforcing Applicability of Real-Time Scheduling Theory Feasibility Tests with the Use of Design-Patterns

Plantec

Singhoff

Dissaux³

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This article deals with performance verifications of architecture models of real-time embedded systems. We focus on models verified with the real-time scheduling theory. To perform verifications with the real-time scheduling theory, the architecture designers must check that their models are compliant with the assumptions of this theory. Unfortunately, this task is difficult since it requires that designers have a deep understanding of the real-time scheduling theory. In this article, we investigate how to help designers to check that an architecture model is compliant with this theory. We focus on feasibility tests. Feasibility tests are analytical methods proposed by the real-time scheduling theory. We show how to explicitly model the relationships between an architectural model and feasibility tests. From these models, we apply a model-based engineering process to generate a decision tool what is able to detect from an architecture model which are the feasibility tests that the designer can apply.

show abstract

Schedulability analysis of AADL models

Cited by 51 publications

References 13 publications

An ocarina extension for AADL formal semantics generation

An ocarina extension for AADL formal semantics generation

From AADL to Timed Abstract State Machines: A verified model transformation

Enforcing Applicability of Real-Time Scheduling Theory Feasibility Tests with the Use of Design-Patterns

Contact Info

Product

Resources

About