1 / 3

Advantages of Formal Methods

Advantages of Formal Methods. Formal methods treat system components as mathematical objects and provide mathematical models to describe and predict the observable properties and behaviors of these objects.

blythe
Download Presentation

Advantages of Formal Methods

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Advantages of Formal Methods • Formal methods treat system components as mathematical objects and provide mathematical models to describe and predict the observable properties and behaviors of these objects. • There are several advantages to using formal methods for the specification and analysis of real-time systems. • the early discovery of ambiguities, inconsistencies and incompleteness in informal requirements • the automatic or machine-assisted analysis of the correctness of specifications with respect to requirements • the evaluation of design alternatives without expensive prototyping

  2. Formal Specification Methods • Logic • Z, VDM, First order logic, temporal logic • State Machines • Finite state machines, communicating state machines, extended state machines • State Chart, Objectime, Automata • Petri Nets • Process Algebra • CSP , CCS, ATP, ACSR • CWB, PARAGON

  3. Verification Methods • Verification is to show Behavior(Design) Í Behavior(Requirement) • Verification Methods • Proof System : SP Þ f • Model Checking : Pd f • Behavioral Specification : Pd sat f E.g. 0 <=(# of coins in t) - (# of candies in t) <= 1 • Algebraic(bisimulation, process containment): • Pr~ Pd,,Pr Pd,

More Related