Verification of component-based embedded system designs by by Daniel Karlsson.

By by Daniel Karlsson.

Show description

Read Online or Download Verification of component-based embedded system designs PDF

Similar microprocessors & system design books

Designing Embedded Systems with PIC Microcontrollers: Principles and Applications

This publication is a hands-on creation to the rules and perform of embedded procedure layout utilizing the PIC microcontroller. filled with valuable examples and illustrations, it offers an in-depth remedy of microcontroller layout, programming in either meeting language and C, and contours complicated issues comparable to networking and real-time working platforms.

Logic and Language Models for Computer Science

This article makes in-depth explorations of a extensive variety of theoretical subject matters in computing device technological know-how. It plunges into the functions of the summary thoughts for you to confront and tackle the skepticism of readers, and instill in them an appreciation for the usefulness of concept. A two-part presentation integrates common sense and formal language—both with purposes.

Additional resources for Verification of component-based embedded system designs

Example text

However, the state space generally grows exponentially with the size of the transition system. This problem is usually referred to as the state space explosion problem. A major consequence of the state space explosion problem is that many designs are difficult to formally verify in a reasonable amount of time. As, basically, every reachable state in the state space is visited one by one by the classical model checking algorithm, it is not feasible to check very large systems with a reachable state space of above 106 states.

However, when verifying the interaction of several components through a glue logic, interconnecting the components, several drawbacks arise. The environment of a given component, in this case, consists of models of the glue logic and of other components, expressed in the particular design representation used. Therefore, assumption formulas have to be extracted from these models with respect to the property to be verified. That is not always easy, especially considering that the environment components, in turn, depend on yet other components.

ACTL formulas do not have any existential path quantifiers and negation only occurs in front of atomic propositions. Hence, AGAF p and AF ¬ p are ACTL formulas, whereas AGEF p and ¬AF p are not. As mentioned previously, CTL can only express relative time, such as “ p must be true some time in the future”. In many applications, however, it is desired to set a time limit within which a certain property must become true. ” This time limit is indicated by a subscript on the temporal operators. AF∼ x p , where ∼ ∈ {<, ≤, =, ≥ , >} intuitively indicates the relationship between the time of the current state and the time point x when p must be true.

Download PDF sample

Rated 4.29 of 5 – based on 42 votes