ITEA 2 – 09033: TIMMO-2-USE Timing Model – Tools, algorithms, languages, methodology, USE cases 2012-09-24..25AMST Workshop - BerlinSlide 1 Modeling timing.

Slides:



Advertisements
Similar presentations
1 IEEE Media Independent Handoff Overview of services and scenarios for 3GPP2 Stefano M. Faccin Liaison officer to 3GPP2.
Advertisements

InnoSys Process Sequence. End Effector Components End Effector Prox Switch Load Cell Wire Conduit Crows Foot Nut Runner.
Software Quality Assurance Plan
CNT 4603: Managing/Maintaining Server 2008 – Part 3 Page 1 Dr. Mark Llewellyn © CNT 4603: System Administration Spring 2014 Managing And Maintaining Windows.
LASER From Natural Language Requirements to Rigorous Property Specifications Lori A. Clarke Work done in collaboration with Rachel L. Smith, George S.
Tutorial 2, Part 1: Optimization of a damped oscillator.
An Automata-based Approach to Testing Properties in Event Traces H. Hallal, S. Boroday, A. Ulrich, A. Petrenko Sophia Antipolis, France, May 2003.
Enterprise Privacy Promises and Enforcement Adam Barth John C. Mitchell.
CPSC 668Set 16: Distributed Shared Memory1 CPSC 668 Distributed Algorithms and Systems Fall 2006 Prof. Jennifer Welch.
Expressing Giotto in xGiotto and related schedulability problems Class Project Presentation Concurrent Models of Computation for Embedded Software University.
Bellevue University CIS 205: Introduction to Programming Using C++ Lecture 7: Methods.
Chapter 2: Algorithm Discovery and Design
CprE 458/558: Real-Time Systems
CIS607, Fall 2005 Semantic Information Integration Article Name: Clio Grows Up: From Research Prototype to Industrial Tool Name: DH(Dong Hwi) kwak Date:
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
Merging 3D layers in Photoshop. Photoshop document with one layer.
Systems Analysis I Data Flow Diagrams
NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.
JS Arrays, Functions, Events Week 5 INFM 603. Agenda Arrays Functions Event-Driven Programming.
9/14/2012ISC329 Isabelle Bichindaritz1 Database System Life Cycle.
Task Scheduling By Dr. Amin Danial Asham.
ITEA 2 – 09033: TIMMO-2-USE Timing Model – Tools, algorithms, languages, methodology, USE cases AMST Open Workshop - BerlinSlide 1 Generic Methodology.
FCS - AAO - DM COMPE/SE/ISE 492 Senior Project 2 System/Software Test Documentation (STD) System/Software Test Documentation (STD)
Grant Pannell. Intrusion Detection Systems  Attempt to detect unauthorized activity  CIA – Confidentiality, Integrity, Availability  Commonly network-based.
International Telecommunication Union Geneva, 9(pm)-10 February 2009 Providing testability for ITU Recommendations Ostap Monkewich, OMCI ITU-T Workshop.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Intent Specification Intent Specification is used in SpecTRM
Sponsor: Dr. K.C. Chang Tony Chen Ehsan Esmaeilzadeh Ali Jarvandi Ning Lin Ryan O’Neil Spring 2010.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Appendix B A BRIEF TOUR OF SOLVER Prescriptive Analytics
1/26/2004TCSS545A Isabelle Bichindaritz1 Database Management Systems Design Methodology.
14004 L6 - © D. Deugo, 2003 – 2008 Lecture 6 Towards Testable Interaction Diagrams (A theoretical lecture with few examples…  )
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
ME451:Kinematics and Dynamics of Machine Systems (Spring 09)
M1G Introduction to Database Development 5. Doing more with queries.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
Requirement Handling
SW318 Social Work Statistics Slide 1 Measure of Variability: Range (1) This question asks about the range, or minimum and maximum values of the variable.
Software Architecture Evaluation Methodologies Presented By: Anthony Register.
CSE SW Project Management / Module 15 - Introduction to Effort Estimation Copyright © , Dennis J. Frailey, All Rights Reserved CSE7315M15.
Tutorial 3, Part 1: Optimization of a linear truss structure
ADAMS Assignment 6 ME451:Kinematics and Dynamics of Machine Systems (Fall 2013) Assigned: November 13, 2013 Due: November 20, 2013.
1/8/ L16 Timing & Concurrency III Copyright Joanne DeGroat, ECE, OSU1 Timing & Concurrency III Delay Model foundations for simulation and.
MEMORY GENERATORS MEMPRO Instructor: Dr. Anthony Johnson Presented by: Rajesh Natarajan Motheeswara Salla.
Introduction to the Strategic Planning Resources Book.
Non-Determinism In C and RTL Models ICCAD 2006 – Ira Chayut, Verification Architect.
Static Timing Analysis
Mok & friends. Resource partition for real- time systems (RTAS 2001)
COP 2220 Computer Science I Topics –Breaking Problems Down –Functions –User-defined Functions –Calling Functions –Variable Scope Lecture 4.
Applying SDL for Real-Time Systems Development: A Lip- Synchronisation Case Study Dr Richard Sinnott EPK Ericsson.
Lecture 1 INTRODUCTION TO ALGORITHMS Professor Uday Reddy
Application Analysis. Application Interaction Model The purpose of analysis is to understand the problem so.
WS7-1 ADM , Workshop 7, August 2005 Copyright  2005 MSC.Software Corporation WORKSHOP 7 DESIGN OF EXPERIMENTS.
Slide 1 Chapter 3 Variables  A variable is a name for a value stored in memory.  Variables are used in programs so that values can be represented with.
Chapter 3.6 Chain Rule. Objectives Differentiate composite functions using the Chain Rule. Find the slopes of parameterized curves.
Sequence diagrams Lecture 5. Main terms  Interaction  Life line  Activation  Executable behavior and derived behavior  Messages  Trajectory  Frame.
VAB™ for INFINITY Tutorial
WORKSHOP 1 STAMPING MECHANISM
Microsoft Office Illustrated
Impact of Magnet Performance on the Physics Program of MICE
Daniel Amyot and Jun Biao Yan
Tolerances Introduction to Engineering Design
Navya Thum February 13, 2013 Day 7: MICROSOFT EXCEL Navya Thum February 13, 2013.
Winter 2018 CISC101 12/2/2018 CISC101 Reminders
Tolerances Introduction to Engineering Design
Event-Based Architecture Definition Language
Tolerances.
IWG Worn tyres Tyre Industry work status July 17th 2019
IWG Worn tyres Tyre Industry work status July 17th 2019
IWG Worn tyres Tyre Industry work status July 17th 2019
Presentation transcript:

ITEA 2 – 09033: TIMMO-2-USE Timing Model – Tools, algorithms, languages, methodology, USE cases AMST Workshop - BerlinSlide 1 Modeling timing constraints, parameterized and multi-clock systems in TADL2 Johan Nordlander, Chalmers University of Technology

System models & constraints AMST Workshop - BerlinSlide 2 A system model: Industry objective: specify / characterize / verify models using constraints logical... resource usage... cost... timing... structural...

TADL2 (Timing Augmented Description Language) AMST Workshop - BerlinSlide 3 A language of timing constraints (and timing constraints only) TADL2 Model Constraints Connecting points: the events exposed by a system model Delay... Periodic...

Events & occurrences AMST Workshop - BerlinSlide 4 For each execution / simulation / prediction of a system, every event occurs a some points in time. Model time TADL2 constraints put demands on the relative placement of such occurrences

Source-to-target delay What if source repeats? Can multiple target occurrences match? Are stray target occurrences allowed? The need for semantic precision AMST Workshop - BerlinSlide 5 But what about jitter? What if jitter > period? What if repetition stops? Is jitter meaningful here too? Same as upper-lower difference? Accumulating vs. non-accumulating drift? Some well-known occurrence patterns: Periodic repetition Sporadic repetition

DelayConstraint AMST Workshop - BerlinSlide 6 DelayConstraint (source, target, lower, upper)   x  source :  y  target : lower ≤ y – x ≤ upper time source target lower upper duplicate and stray occurrences allowed

StrongDelayConstraint AMST Workshop - BerlinSlide 7 StrongDelayConstraint (source, target, lower, upper)   i :  x : x = source(i)   y : y = target(i) : lower ≤ y – x ≤ upper time source target lower upper duplicate and stray occurrences disallowed (lock-step enforced)

ReactionConstraint AMST Workshop - BerlinSlide 8 time minimum maximum stimulus response scope ReactionConstraint ( scope, minimum, maximum )   x  scope.stimulus :  y  scope.response : x.color = y.color  (  y’  scope.response : y’.color = y.color  y ≤ y’)  minimum ≤ y – x ≤ maximum only first related response of interest

TADL2 constraint overview AMST Workshop - BerlinSlide 9 DelayConstraint (source, target, lower, upper) StrongDelayConstraint (source, target, lower, upper) RepetitionConstraint (event, lower, upper, span, jitter) SynchronizationConstraint (event, tolerance) StrongSynchronizationConstraint (event, tolerance) ExecutionTimeConstraint (start, stop, preempt, resume, lower, upper) OrderConstraint (source, target) ComparisonConstraint (leftOperand, rightOperand, operator) SporadicConstraint (event, lower, upper, jitter, minimum) PeriodicConstraint (event, period, jitter, minimum) PatternConstraint (event, period, offset, jitter, minimum) ArbitraryConstraint (event, minimum, maximum) BurstConstraint (event, length, maxOccurrences, minimum) ReactionConstraint (scope, minimum, maximum) AgeConstraint (scope, minimum, maximum) OutputSynchronizationConstraint (scope, tolerance) InputSynchronizationConstraint (scope, tolerance) + mode-dependency parameter (optional)

... but quite ok when restricted to mode M! M A mode-dependent DelayConstraint AMST Workshop - BerlinSlide 10 time source target lower upper Not satisfied overall... start(M) stop(M) (a mode is defined by its start- and stop-events)

M A borderline mode-example AMST Workshop - BerlinSlide 11 time source target lower upper start(M) stop(M) Should this trace be accepted by the mode-dependent DelayConstraint? There’s no matching target occurrence inside M... TADL2 thus chooses to answers yes! (the optimistic assumption)... but a matching occurrence is still possible outside M (where we don’t look!)

AMST Workshop - BerlinSlide 12 Revision History Do not delete this slide! RevisionDateDescription Initial Draft

AMST Workshop - BerlinSlide 13 Notepad Do not delete this slide!