2022Unpublished venueOpen access

SYMBOLIC MODEL CHECKING FOR MODULAR SYSTEMS

F. Ouazar, M. C. Boukala and M. Ioualalen

Open full text 0 citations

Abstract

Model checking verification is a formal and fully automatic method widely used for checking critical and complex systems. It is based on reachability analysis, which often encounters the state space explosion problem. In this paper, we present our

Open-access reader

About this research paper

What this paper is about

Model checking verification is a formal and fully automatic method widely used for checking critical and complex systems. It is based on reachability analysis, which often encounters the state space explosion problem. In this paper, we present our

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Model checking verification is a formal and fully automatic method widely used for checking critical and complex systems. It is based on reachability analysis, which often encounters the state space explosion problem. In this paper, we present our

Key concepts: Model checking, Reachability, Symbolic trajectory evaluation, Computer science, Modular design, Formal verification, State space, Abstraction model checking

Related papers

Back to paper searchBrowse research topicsOriginal source
SYMBOLIC MODEL CHECKING FOR MODULAR SYSTEMS — Research Paper | ScholarLens