Dr. Vered Gafni – Real time systems development by the formal approach 1 The Design Language of Statecharts.

Slides:



Advertisements
Similar presentations
?????????? ? ? ? ? ? ? ? ? ? ????????? ????????? ????????? ????????? ????????? ????????? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?? ? ?? ?? TM.
Advertisements

CS 208: Computing Theory Assoc. Prof. Dr. Brahim Hnich Faculty of Computer Sciences Izmir University of Economics.
Vered Gafni – Formal Development of Real Time Systems 1 Statecharts Semantics.
CSE 202 – Formal Languages and Automata Theory 1 REGULAR LANGUAGE.
Vered Gafni, The Design Language of Statecharts.
 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.
1 If we modify the machine for the language from F12 p. 47 we can easily construct a machine for the language Observation Turing machine for the language.
Theory Of Automata By Dr. MM Alam
Finite Automata Section 1.1 CSC 4170 Theory of Computation.
CFG => PDA Sipser 2 (pages ).
Intro to DFAs Readings: Sipser 1.1 (pages 31-44) With basic background from Sipser 0.
CFG => PDA Sipser 2 (pages ). CS 311 Fall Formally… A pushdown automaton is a sextuple M = (Q, Σ, Γ, δ, q 0, F), where – Q is a finite set.
Turing Machines New capabilities: –infinite tape –can read OR write to tape –read/write head can move left and right q0q0 input tape.
CS5371 Theory of Computation
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
Laplante + Skubic 1 Formal methods in software specification  Finite state machines  Statecharts  Propositional logic.
CSC 402 Requirements Engineering 1 Requirements Techniques, cont. Formal requirements analysis techniques include: – DFD (covered) – ERD (covered) – Finite.
CS 310 – Fall 2006 Pacific University CS310 Turing Machines Section 3.1 November 6, 2006.
1 Finite Automata. 2 Finite Automaton Input “Accept” or “Reject” String Finite Automaton Output.
Requirements Techniques, cont. Brief review Formal Requirements Techniques –Finite State Machines –Petri Nets.
UNIVERSAL TURING MACHINES. OUTLINE Review Algorithm Why.
Rosen 5th ed., ch. 11 Ref: Wikipedia
Theory of Computation - Lecture 3 Regular Languages What is a computer? Complicated, we need idealized computer for managing mathematical theories... Hence:
Computer Science 101 Theory of Computing. Computer Science is... The study of algorithms, with respect to –their formal properties –their linguistic realizations.
Finite Automata – Definition and Examples Lecture 6 Section 1.1 Mon, Sep 3, 2007.
Complexity and Computability Theory I Lecture #11 Instructor: Rina Zviel-Girshin Lea Epstein.
State Chart diagram Week objective Describe State chart Diagrams in Dynamic Modelling 2.
Finite State Machines 1.Finite state machines with output 2.Finite state machines with no output 3.DFA 4.NDFA.
Simulation Driven Virtual Reality: A Framework for Large Scale Virtual Simulation Lacey Duckworth February 16, 2008.
Presentation.  Julius Richard Büchi (1924–1984)  Swiss logician and mathematician.  He received his Dr. sc. nat. in 1950 at the ETH Zürich  Purdue.
CSE 202 – Formal Languages and Automata Theory 1 REGULAR EXPRESSION.
Mealy Machines Finite State Machines with Outputs given on the transitions.
Theory of Computation Automata Theory Dr. Ayman Srour.
Theory of Computation Automata Theory Dr. Ayman Srour.
Theory of Languages and Automata By: Mojtaba Khezrian.
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 Σ:
Requirements Techniques, cont.
Formal Foundations-II [Theory of Automata]
ماشین های تورینگ، تشخیص پذیری و تصمیم پذیری زبان ها
Lecture2 Regular Language
Deterministic Turing Machines
COSC 3340: Introduction to Theory of Computation
10.3 Finite State Machines.
The Encoding of TM Motivation for encoding of TM
Pumping Lemma Revisited
COSC 3340: Introduction to Theory of Computation
Nondeterministic Finite Automata
Tips Need to Consider When Organizing a College Event
Finite State Machines and Statecharts
زبان بدن Body Language.
CSC 4170 Theory of Computation Nondeterminism Section 1.2.
CSC 422 Kutztown University Dr. Spiegel
Chapter 3: The CHURCH-Turing thesis
Non-Deterministic Finite Automata
ماجستير إدارة المعارض من بريطانيا
Finite State Machines and Statecharts
The design, implementation, integration and evaluation of a Statechart service. By Xin Bai Feb 7, 2002.
Chapter 3 Turing Machines.
Pushdown Automaton (PDA)
Machine Learning Course.
COSC 3340: Introduction to Theory of Computation
What number is the arrow pointing at?
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.
CSC 4170 Theory of Computation Nondeterminism Section 1.2.
Chapter 1 Regular Language
Teori Bahasa dan Automata Lecture 4: Non-deterministic Finite Automata
CSC 4170 Theory of Computation Finite Automata Section 1.1.
LANGUAGE EDUCATION.
COSC 3340: Introduction to Theory of Computation
Teori Bahasa dan Automata Lecture 6: Regular Expression
Presentation transcript:

Dr. Vered Gafni – Real time systems development by the formal approach 1 The Design Language of Statecharts

Dr. Vered Gafni – Real time systems development by the formal approach 2 The Design Language of Statecharts Finite State Machine R, S, T – States a, b, c, d - Events Arrows - State transitions Event: a, b, c,... a or/and b not a dly(t), tm(a,t) tr(C)/fs(C) Conditions: A, B,... A or/and B not(A) in(S) x=y, x<y,…. Actions: a,b,… tr!(C)/fs!(C) x := v rd!(x) Initial state optional

Dr. Vered Gafni – Real time systems development by the formal approach 3 Examples Split on condition

Dr. Vered Gafni – Real time systems development by the formal approach 4 Sub-States: Sequential Refinement S is a super-state w.r.t {S1, S2, S3 } Super-state transitions (priority) History entrance (H* -deep history)

Dr. Vered Gafni – Real time systems development by the formal approach 5 Example of Sequential Refinement Equivalence up to priorities

Dr. Vered Gafni – Real time systems development by the formal approach 6 Sub-states: Parallel Refinement Events broadcasting

Dr. Vered Gafni – Real time systems development by the formal approach 7 Delay: To turn on the furnace open the oil valve, and after 3 seconds activate ignition Specification of Time Constraints RTC: Execute control loop at 10Hz rate

Dr. Vered Gafni – Real time systems development by the formal approach 8 Delay as Deadline Deadline: Whenever train enters XR, gate should be closed within 10 seconds; otherwise an alarm will be activated

Dr. Vered Gafni – Real time systems development by the formal approach 9 Where Timeout is useful ?

Dr. Vered Gafni – Real time systems development by the formal approach 10 Synchronization Techniques I

Dr. Vered Gafni – Real time systems development by the formal approach 11 Synchronization Techniques II

Dr. Vered Gafni – Real time systems development by the formal approach 12 Synchronization Techniques III

Dr. Vered Gafni – Real time systems development by the formal approach 13 Example: Railroad crossing

Dr. Vered Gafni – Real time systems development by the formal approach 14 Crossing Control: Sequential Design

Dr. Vered Gafni – Real time systems development by the formal approach 15 Crossing Control: Parallel Design

Dr. Vered Gafni – Real time systems development by the formal approach 16 Example: Automatic Cruise Control

Dr. Vered Gafni – Real time systems development by the formal approach 17 Automatic Cruise Control

Dr. Vered Gafni – Real time systems development by the formal approach 18 State Operating (sub-state of Active)

Dr. Vered Gafni – Real time systems development by the formal approach 19 State CommandMonitor (component of Operating)

Dr. Vered Gafni – Real time systems development by the formal approach 20

Dr. Vered Gafni – Real time systems development by the formal approach 21 Statemate 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

Dr. Vered Gafni – Real time systems development by the formal approach 22

Dr. Vered Gafni – Real time systems development by the formal approach 23 Basic Components A A1 A2 A3 C A2_1 A2_2 E1 E2 E3 CC u v w q e f h r x s fff

Dr. Vered Gafni – Real time systems development by the formal approach 24

Dr. Vered Gafni – Real time systems development by the formal approach 25

Dr. Vered Gafni – Real time systems development by the formal approach 26

Dr. Vered Gafni – Real time systems development by the formal approach 27

Dr. Vered Gafni – Real time systems development by the formal approach 28

Dr. Vered Gafni – Real time systems development by the formal approach 29

Dr. Vered Gafni – Real time systems development by the formal approach 30

Dr. Vered Gafni – Real time systems development by the formal approach 31

Dr. Vered Gafni – Real time systems development by the formal approach 32