Vered Gafni, 20051 The Design Language of Statecharts.

Slides:



Advertisements
Similar presentations
The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.
Advertisements

Sunken Millions Simple Machines Level One >>>> >>>>
State Diagram 1. State diagram: Shows the behavior of one object. They describe all of the possible states that a particular object can get into and how.
State Charts Mehran Najafi. Reactive Systems A reactive, event-driven, object is one whose behavior is best characterized by its response to events dispatched.
The results of repeated observations and/or experiments concerning a naturally occurring event (phenomenon) are reasonably the same when performed and.
The Logic of Quantified Statements
Algorithmic Software Verification VII. Computation tree logic and bisimulations.
Principles of Engineering System Design Dr T Asokan
Vered Gafni – Formal Development of Real Time Systems 1 Statecharts Semantics.
Dr. Vered Gafni – Real time systems development by the formal approach 1 The Design Language of Statecharts.
Week 6Fall 2001 CS5991 The STATEMATE Semantics of Statecharts D. Harel and A. Naamand Ahmad Alsawi 1-4 Bob Chen 5-8 Dapeng Xie 9-11.
Elements of Lambda Calculus Functional Programming Academic Year Alessandro Cimatti
 Dr. Vered Gafni 1 Modeling Real-Time Systems.  Dr. Vered Gafni 2 Behavioral Model (Signature, Time) Signature: v 1 :D 1, v 2 :D 2,…,v n :D n S = (D.
CS 290C: Formal Models for Web Software Lecture 4: Implementing and Verifying Statecharts Specifications Using the Spin Model Checker Instructor: Tevfik.
Temporal Logics Express reactive properties (order of events in time)
1 Powers of Two: Trace Ex. Print powers of 2 that are  2 N. Increment i from 0 to N. Double v each time. int i = 0; int v = 1; while (i
Slide 10B.1 Copyright © 2004 by The McGraw-Hill Companies, Inc. All rights reserved. An Introduction to Object-Oriented Systems Analysis and Design with.
1 CS 691z/791z Topics in Software Engineering Chapter 13: Activity Diagrams & Chapter 19: Basic Statecharts [Arlow and Neustadt, 2002] March 8, 2007.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Specification Formalisms Book: Chapter 5. Properties of formalisms Formal. Unique interpretation. Intuitive. Simple to understand (visual). Succinct.
THE OBJECT-ORIENTED DESIGN WORKFLOW Statechart Diagrams.
State Change Modelling. Aim: To introduce the concept and techniques for describing the changes in state that may occur to an object in its lifetime.
Advanced Behavioral Modeling
University of Toronto Department of Computer Science © Steve Easterbrook. This presentation is available free for non-commercial use with attribution.
Adapted from Walch Education The conditional probability of B given A is the probability that event B occurs, given that event A has already occurred.
Unit 5 Simple Present, Time Clauses, Used To, and Would.
Activity Diagram. C-S 5462 Activity diagram a diagram that represents a sequence of activities similar to flow chart, used in 1960’s and 1970’s an activity.
Lecture 4 Finite State Machine CS6133 Software Specification and Verification.
Rosen 5th ed., ch. 11 Ref: Wikipedia
Chapter 10 State Machine Diagrams
NJIT Modeling Behavior in State Chart Diagrams Chapter 29 Rafael Mello.
Chapter 8 Probability Section R Review. 2 Barnett/Ziegler/Byleen Finite Mathematics 12e Review for Chapter 8 Important Terms, Symbols, Concepts  8.1.
Guide to State Transition Diagram. 2 Contents  What is state transition diagram?  When is state transition diagram used?  What are state transition.
Foundations of Software Testing Slides based on: Draft V1.0 August 17, 2005 Test Generation: Statecharts Last update: September 24, 2005 These slides are.
Session 21 Applying the Basic Statechart to the Case Study Written by Thomas A. Pender Published by Wiley Publishing, Inc. October 27, 2011 Presented by.
Information System Design IT60105
Software Engineering Design & Modeling Statechart Diagram.
Real Time Systems Behaviour Exercise Solution. Behaviour Exercise - 2 Exercise  Refer to the following 2 state diagrams:  Television Satellite Receiver.
© 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1 UML State Diagrams.
States.
CS3773 Software Engineering Lecture 06 UML State Machines.
Practical Object-Oriented Design with UML 2e Slide 1/1 ©The McGraw-Hill Companies, 2004 PRACTICAL OBJECT-ORIENTED DESIGN WITH UML 2e Chapter 10: Statecharts.
Sahar Mosleh California State University San MarcosPage 1 Finite State Machine.
Modeling Object Lifecycles and State-Dependent Behavior ©SoftMoore ConsultingSlide 1.
Dynamic Models - Page L M.E. Fayad Lesson 30: Dynamic Models Object- Oriented Modeling & Application s.

CIS 725 Lecture 2. Finite State Machine Model FSM = (A, S, T, s 0 ) A = set of actions S = set of states s 0 = initial states T = transition relation.
The Dynamic Analysis Model StateCharts Prof. Hany H. Ammar, CSEE, WVU, and Dept. of Computer Science, Faculty of Computers and Information, Cairo University.
Deterministic Finite-State Machine (or Deterministic Finite Automaton) A DFA is a 5-tuple, (S, Σ, T, s, A), consisting of: S: a finite set of states Σ:
Activity Diagram.
1.3 Finite State Machines.
10.3 Finite State Machines.
UML State Diagrams.
Tips Need to Consider When Organizing a College Event
Finite State Machines and Statecharts
CSC 422 Kutztown University Dr. Spiegel
Calculating Probabilities
States.
Object Oriented System Design
ماجستير إدارة المعارض من بريطانيا
Problem 1: Ambiguity of rules when state diagrams are combined with Pascal August 11, 2008.
State Machines Massimo Felici.
Finite State Machines and Statecharts
Chapter 3 Turing Machines.
States.
Solving Compound Inequalities
What number is the arrow pointing at?
UML State Diagrams.
LANGUAGE EDUCATION.
Copyright © 2015, 2012, 2009 Elsevier Inc. All rights reserved.
Presentation transcript:

Vered Gafni, The Design Language of Statecharts

Vered Gafni, Simple Statechart Finite State Machine R, S, T – States a, b, c, d - Events Arrows - State transitions (source-less arrow denotes an initial state).

Vered Gafni, Transition Events Syntax

Vered Gafni, Events {a, b, c,.... } atomic events: a or b a occurs or b occurs a and b a occurs and b occurs not(a) a does not occur tm(a,t) t time-units after the occurrence of a tr( C ) condition C becomes true fs( C ) condition C becomes false en(S) state S is entered ex(S) state S is exited

Vered Gafni, Conditions A, B,.... atomic conditions: A or B A is true or B is true A and B A is true and B is true not(A) A is false in(S) True while the system is in state S X=Y, X<Y,…. Boolean relations

Vered Gafni, Actions a,b,… atomic actions tr!(C) make condition C True fs!(C) make condition C False wr!(V) write variable V rd!(V) read variable V  atomic actions also considered event generation

Vered Gafni, Example of Compound Transition

Vered Gafni, Transition Connectors

Vered Gafni, L H valv e Water-level sensor Controller Valve command

Vered Gafni, Sub-States: Sequential Refinement S is a super-state w.r.t {S1, S2, S3 } Super-state transitions (priority) History entrance (H* -deep history)

Vered Gafni, Example of Sequential Refinement Equivalence up to priorities

Vered Gafni, Sub-states: Parallel Refinement Events broadcasting

Vered Gafni, דוגמא - בקר שיוט רכב Automatic Cruise Control

Vered Gafni, Automatic Cruise Control

Vered Gafni, Operating

Vered Gafni,

Vered Gafni,

Vered Gafni, Railroad Crossing Control

Vered Gafni, Crossing Control: Sequential Design

Vered Gafni, Crossing Control: Parallel Design

Vered Gafni, Using Timeout Delay Periodic activation deadline

Vered Gafni, Timeout as Delay To activate the furnace open the oil valve, and after 3 seconds operate ignition Idle Ignition_ delay Furnace _Active Activate/Open_oil_valve tm(Activate,3sec)/Ignite

Vered Gafni, Timeout for Periodic Activation Execute control loop at 10Hz rate RTC /tick tm(tick,100mls)/tick WaitTick Control Loop tick done

Vered Gafni, Timeout as Deadline Whenever train enters XR, gate should be closed within 10 seconds; otherwise an alarm will be activated WaitTrain Tin/CloseGate tm(en(Closing),10sec)/Alarm Closed Closing GateClosed FailClosing

Vered Gafni, Synchronization Techniques I

Vered Gafni, Synchronization Techniques II

Vered Gafni, Synchronization Techniques III

Vered Gafni, Transition Functions [K]  true[K] where ‘true’ is an event that occurs at every time instant

Vered Gafni, Magnum A Real-Time Design Tool Provides for representation of 3 system views: What: - the activities the system should do, and inter-activities data flow When: - the timing and synchronization of activities activation and data transfer Where: - in what subsystem the each activity should be implemented

Vered Gafni,

Vered Gafni, Basic Components A A1 A2 A3 C A2_1 A2_2 E1 E2 E3 CC u vw q e f h r x s

Vered Gafni,

Vered Gafni,

Vered Gafni,

Vered Gafni,

Vered Gafni,

Vered Gafni,

Vered Gafni,

Vered Gafni,

Vered Gafni,