Concurrent Scheduling of Event-B Models

Boström, Pontus; Degerlund, Fredrik; Sere, Kaisa; Waldén, Marina

doi:10.4204/eptcs.55.11

Cited by 4 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to the refinement and extension, Event-B introduces decomposition [17], [18] to address the modeling complexity and provides the modeling of parallel and concurrent systems [19], [20]. Decomposition is a mechanism that splits the model into smaller sub-models.…”

Section: B Event-bmentioning

confidence: 99%

Formal Verification of AADL Models by Event-B

Hadad

Ahmed

2020

IEEE Access

View full text Add to dashboard Cite

AADL is widely used to depict the architecture and behavior of real-time safety-critical systems such as avionics and aerospace. The development of these systems has strict requirements for building fault-free systems. Formal verification is frequently applied to verify the critical properties of the systems, such as safety and liveness; however, the formal verification is not supported by AADL. Model transformation is commonly applied to provide formal semantics; hence, the AADL model can be verified by a language that supports formal verification in addition to the ability to cover all AADL model behavior. Event-B, with its proof obligation, is increasingly used to model and verify safety-critical systems. This paper presents the transformation of the AADL model into Event-B, which captures most AADL components and behavioral actions to be effective in the verification of current real-time systems models. Then, we define theorems and invariants of safety and liveness properties to be proven by using the RODIN platform. To demonstrate the efficacy of our method, we model the AADL of movement authority (MA) control of the Chinese Train Control System, transform the AADL model to Event-B and verify its crucial properties.

show abstract

Section: B Event-bmentioning

confidence: 99%

Formal Verification of AADL Models by Event-B

Hadad

Ahmed

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

Derivation of concurrent programs by stepwise scheduling of Event-B models

et al. 2014

View full text Add to dashboard Cite

Concurrent programs are often complex and they are not straightforward to develop and prove correct. Formal development methods based on refinement make it possible not only to derive programs gradually, but also to prove their correctness in a stepwise fashion. Event-B is a formal framework that has been shown useful for developing concurrent and distributed programs. In order to scale to large systems, models can be decomposed into sub-models that can be refined semi-independently and executed in parallel. In this paper, we show how to introduce explicit control flow for the concurrent sub-models in the form of event schedules. The purpose of these schedules is both to provide process-oriented specifications of the programs to complement the state-based approach in Event-B, as well as to facilitate more efficient implementation of the models. The schedules are introduced in a stepwise manner and should be designed to result in a correctness-preserving refinement step. In order to reduce the verification burden on the developers, we provide patterns for schedule introduction, together with their associated proof obligations. We demonstrate our method by applying it on the dining philosophers problem.

show abstract