Chapter 6: Real-Time Logic

Slides:



Advertisements
Similar presentations
Modeling Software Systems Lecture 2 Book: Chapter 4.
Advertisements

Automatic Verification Book: Chapter 6. What is verification? Traditionally, verification means proof of correctness automatic: model checking deductive:
Temporal Logic and the NuSMV Model Checker CS 680 Formal Methods Jeremy Johnson.
1 Simulator-Model Checker for Reactive Real-Time Abstract State Machines Anatol Slissenko University Paris 12 Pavel Vasilyev University Paris 12 University.
A logic for true concurrency Paolo Baldan and Silvia Crafa Universita’ di Padova.
1 Z Schemas Chapter 7 Formal Specification using Z Example of Z specification Document.
Modeling Software Systems Lecture 2 Book: Chapter 4.
© Katz, 2007 Formal Specifications of Complex Systems-- Real-time 1 Adding Real-time to Formal Specifications Formal Specifications of Complex Systems.
Natural Numbers The Natural or counting numbers are denoted by N and are defined by:
Algebraic Expressions and Formulas
Floyd Hoare Logic. Semantics A programming language specification consists of a syntactic description and a semantic description. Syntactic description:symbols.
Math 009 Unit 5 Lesson 2. Constants, Variables and Terms A variable is represented by a letterx is a variable A number is often called a constant-9 is.
An algebraic expression is a mathematical expression containing numbers, variables, and operational signs. Algebraic Expression.
1 Z Schemas Chapter 6 Formal Specification using Z.
Chapter 1 Foundations for Algebra
Chapter 2 Definitions Numbers such as 3 and -3 that are the same distance from 0 but on the opposite side of 0 are called opposites. The set of integers.
Sets and Expressions Number Sets
Formal Analysis and Verification of Real-Time Systems Albert M. K. Cheng Real-Time Systems Laboratory University of Houston.
Chapter 2 Working with Real Numbers. 2-1 Basic Assumptions.
Constraint-based Invariant Inference. Invariants Dictionary Meaning: A function, quantity, or property which remains unchanged Property (in our context):
A dding two negative integers: add the absolute values the answer is negative Adding a negative and a positive number: subtract the absolute values the.
Copyright © 2007 Pearson Education, Inc. Slide R-1.
1 Copyright © 2015, 2011, 2007 Pearson Education, Inc. Chapter 2-1 Equations and Inequalities Chapter 2.
Representing variables according to the ISO/IEC standard.
Chapter 9 Integrity. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.9-2 Topics in this Chapter Predicates and Propositions Internal vs.
Lesson 1 MULTIPLYING MONOMIALS. What are we going to do…  Multiply monomials.  Simplify expressions involving powers of monomials.
UNIT 2 – QUADRATIC, POLYNOMIAL, AND RADICAL EQUATIONS AND INEQUALITIES Chapter 6 – Polynomial Functions 6.1 – Properties of Exponents.
Day Problems Evaluate each expression for 1. a – 2b2. b ÷ c 3. a ÷ c4. -2abc.
CS6133 Software Specification and Verification
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
8-1 Multiplying Monomials This presentation was created following the Fair Use Guidelines for Educational Multimedia. Certain materials are included under.
Lesson 1 Using properties of real numbers. A set is a collection of objects  If all the members of one set are also members of a second set, then the.
Polynomials. The Degree of ax n If a does not equal 0, the degree of ax n is n. The degree of a nonzero constant is 0. The constant 0 has no defined degree.
Advanced Topics in Software Engineering Marjan Sirjani Tehran University Faculty of Engineering ECE Department Tehran,
Chapter 2 Properties of Real Numbers VOCABULARY. Absolute Value  The distance from zero on the number line and the point representing a real number on.
4.1 Introduction to Polynomials. Monomial: 1 term (ax n with n is a non- negative integers, a is a real number) Ex: 3x, -3, or 4xy 2 z Binomial: 2 terms.
Lecture 5 1 CSP tools for verification of Sec Prot Overview of the lecture The Casper interface Refinement checking and FDR Model checking Theorem proving.
REVIEW OF FACTORING Chapters 5.1 – 5.6. Factors Factors are numbers or variables that are multiplied in a multiplication problem. Factor an expression.
Complex Number Systems and Simplifying Algebraic Expressions Critical Thinking Skill: Demonstrate Understanding of Concepts.
1/28/2016COSC , Lecture 81 Real-Time Systems, COSC , Lecture 8 Stefan Andrei.
1/30/2016COSC , Lecture 111 Real-Time Systems, COSC , Lecture 11 Stefan Andrei.
Solving Linear Equations and Inequalities Chapter 2.
Analyzing Equations and Inequalities Objectives: - evaluate expressions and formulas using order of operations - understand/use properties & classifications.
Software Systems Verification and Validation Laboratory Assignment 4 Model checking Assignment date: Lab 4 Delivery date: Lab 4, 5.
Sets and Basic Operations on Sets Notation A set will usually be denoted by a capital letter, such as, A,B,X, Y,..., whereas lower-case letters, a, b,
Ch Variables in Algebra Objective: To recognize and evaluate variable expressions and basic formulas.
CS5270 Lecture 41 Timed Automata I CS 5270 Lecture 4.
Today’s Objective (1) ► 1.) To be able to line up the like terms of 2 polynomials. ► 2.) To be able to add and subtract polynomials.
CHAPTER R: Basic Concepts of Algebra
SS 2017 Software Verification Timed Automata
Rationale Behind the Precise Formulation of the Four Quantifier Rules
Algebra 1 Section 2.2 Add real numbers
Specification and Validation of Real-Time Programs ©A. Mok 2009
Albert M. K. Cheng Real-Time Systems Laboratory and
Chapter 1: Introduction to Real-Time Systems
CSCI1600: Embedded and Real Time Software
Warm-up: Write in scientific notation: ,490,000
Chapter 4: Model Checking of Finite State Systems
Albert M. K. Cheng Real-Time Systems Laboratory University of Houston
Algebra 1 Section 11.3.
CSCI1600: Embedded and Real Time Software
Equations and Inequalities
Chapter 2 Programming Basics.
Program correctness Axiomatic semantics
Algebra 1 Section 2.3.
Like Terms.
Multiplication properties of Exponents
CSE 503 – Software Engineering
Class #17 – Tuesday, October 30
Presentation transcript:

Chapter 6: Real-Time Logic Albert M. K. Cheng

Event-Action Model Event: temporal marker - 4 types Action: schedulable unit of work primitive or composite X;Y X||Y X!N !NY State predicate: assertion about state of the system Timing constraints Event: temporal marker - 4 types external: cannot be cause by system start: begin action stop: end action transition: change in certain state attribute

Timing Constraints Periodic: while <state predicate> execute <action> with period = <time1> deadline = <time2> Sporadic: when <event> execute <action> with deadline = <time1> separation = <time2>

Non-Real-Time Temporal Logic Conventional temporal logic: concerns with relative ordering of events A;(B||C) means ABC or ACB Can model interleaving actions Cannot model parallel actions To deal with absolute timing, add clock variable: clock := clock + c, execute after every action Acceptable only if actions are executed in sequential order

Real-Time Logic 3 types of constants action in capital letters: primitive or composite (partial ordering of events) A.B B appears in composite action A start and stop events: ^A event marking the initiation of action A vA event marking the completion of action A ^A.B ^A.B2

Real-Time Logic Transition event constants: (S := T) (S := F) External event constants: omega BUTTON1 pressing button number 1 Integer constants: @(E,W) --> W E event, W nonnegative integer @(e,i) = time of the i-th occurrence of event e Timing property can be established by showing there does not exist an occurrence function which is consistent with the specification in conjunction with the negation of the safety property under investigation

Examples of RTL Formulas Forall i @(E,i) = t -> t >= 0 Forall i forall j [@(E,i) = t and @(E,j)=t‘ and i < j ] -> t < t‘ forall x @(TrainApproach, x) <= @(^Downgate, x) and @(vDowngate, x) <= @(TrainApproach, x) + 30 forall y @(^Downgate, y) + 15 <= @(vDowngate, y)

Example: Safety Assertion in RTL forall t forall u @(TrainApproach, t) + 45 <= @(Crossing, u) and @(Crossing,u)<@(TrainApproach, t) + 60 -> @(vDowngate, t) <= @(Crossing, u) and @(Crossing, u) <= @(vDowngate, t) + 45