Laplante + Skubic 1 Formal methods in software specification  Finite state machines  Statecharts  Propositional logic.

Slides:



Advertisements
Similar presentations
PROOF BY CONTRADICTION
Advertisements

Vered Gafni, The Design Language of Statecharts.
Dr. Vered Gafni – Real time systems development by the formal approach 1 The Design Language of Statecharts.
Software Requirements Engineering
© Copyright 2004 Dr. Phillip A. Laplante 1 Kernel Architectures  Polled Loop  Synchronized Polled Loop  State-Based Model  Cyclic Executives  Foreground/Background.
SEERE, Neum 2009 Runtime verification of Java programs using ITL Vladimir Valkanov, Damyan Mitev Plovdiv, Bulgaria.
Temporal Specification Chris Patel Vinay Viswanathan.
Lock Inference for Systems Software John Regehr Alastair Reid University of Utah March 17, 2003.
CSC 110 – Intro to Computing Lecture 14: Midterm Review.
1 times table 2 times table 3 times table 4 times table 5 times table
Programming with Function Blocks
What are the functions of an operating system? The operating system is the core software component of your computer. It performs many functions and is,
Lecture 9 & 10: Finite Machines Anita S. Malik Adapted from Schach (2004) Chapter 11.
KEY COMPONENTS OF A COMPUTER SYSTEM ANDREW LOLAVAR.
Formal Methods 1. Software Engineering and Formal Methods  Every software engineering methodology is based on a recommended development process  proceeding.
Contact Information Office: 225 Neville Hall Office Hours: Monday and Wednesday 12:00-1:00 and by appointment.
The Operating System ICS3M.  The operating system (OS) provides a consistent environment for other software programs to execute commands.  It gives.
Chapter 1 Introduction Chapter 1 Introduction 1 st Semester 2015 CSC 1101 Computer Programming-1.
The Central Processing Unit (CPU) and the Machine Cycle.
Here is how to use the table. ( an excerpt of the table is shown ) One tail Two tail We either have.
Chapter 7 The Object-Oriented Approach to Requirements.
Stateflow Toolbox  Stateflow ® is an environment for modeling and simulating combinatorial and sequential decision logic based on state machines and.
CS6133 Software Specification and Verification
IB Computer Science – Logic
OMT Modeling 1. Object Model : presented by the object model and the data dictionary. 2. Dynamic Model: presented by the state diagrams and event flow.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Tables Learning Support
The Master Monitor for the Green Bank Telescope’s Active Surface Amy L. Shelton Digital Engineer Green Bank, West Virginia  Initial design and coding.
3:00. 2:59 2:58 2:57 2:56 2:55 2:54 2:53 2:52.
Object Oriented Analysis and Design Introduction to Rational Rose.
Introduction to Computer Programming using Fortran 77.
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture 16 – 09/09/05 Prof. Pushpak Bhattacharyya Soundness, Completeness,
Logic Gates and Boolean Algebra Introduction to Logic II.
PROBLEM REQUIREMENT Students are required to gather and consolidate information about flight system. For example you may include the information on flight.
I&C Lab Seminar Procedure for the Software Requirements Specification for Safety Critical Systems Seo Ryong Koo Korea Advanced Institute Science.
Nondeterminism The Chinese University of Hong Kong Fall 2011
Digital Logic.
Logic Gates and Truth Tables
Requirements Techniques, cont.
Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.
Dance robot as a tool for implementation of micro-programming
Exceptional Control Flow
How do I show that two compound propositions are logically equivalent?
Biconditional - 2 CS-708.
Exceptional Control Flow
Active Data Management in Space 20m DG
Pre-Reflow Inspection Station (PRIS)
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Times Tables.
Top Fire Protection Services Ottawa available on Dubinskyconstruction
Tips Need to Consider When Organizing a College Event
Finite State Machines and Statecharts
The Lost Art of Argument
CSCI1600: Embedded and Real Time Software
ماجستير إدارة المعارض من بريطانيا
Finite State Machines and Statecharts
Chapter 8 I/O.
KS4 Electricity – Electronic systems
Discrete Mathematics Lecture 2: Propositional Logic
CSCI1600: Embedded and Real Time Software
PROPOSITIONAL LOGIC - SYNTAX-
His Attitude Toward Scripture
2) For each of the finite state machines above, use the sets derived in part 1) to produce the following:   i.                  a set of sequences that.
Introduction to Software Testing Chapter 8.5 Logic Coverage for FSMs
3 times tables.
6 times tables.
2-2 Logic Part 2 Truth Tables.
BETONLINEBETONLINE A·+A·+
Presentation transcript:

Laplante + Skubic 1 Formal methods in software specification  Finite state machines  Statecharts  Propositional logic

Laplante + Skubic 2 Finite state machines

Laplante + Skubic 3 Finite state machines event current stateop_opop_calerror calibrationoperationalcalibrationdiagnostic operationalcalibrationdiagnostic operational calibrationdiagnostic

Laplante + Skubic 4 op_op/a1 Calibration Operational c1 c2 a1a2 o1 o2 a1a2 Statecharts

Laplante + Skubic 5 Propositional Logic Consider the following excerpt from the Software Requirements Specification for the nuclear monitoring system. 1.1 If interrupt A arrives, then task B stops executing. 1.2 Task A begins executing upon arrival of interrupt A. 1.3 Either Task A is executing and Task B is not, or Task B is executing and Task A is not, or both are not executing. These requirements can be formalized by rewriting each in terms of their component propositions, namely: p: interrupt A arrives q: task B is executing r: task A is executing

Laplante + Skubic 6 Propositional Logic Truth table used to check the consistency of the set of three requirements.