Causality Interface  Declares the dependency that output events have on input events.  D is an ordered set associated with the min ( ) and plus ( ) operators.

Slides:



Advertisements
Similar presentations
BioDEVS: System-Oriented, Multi-Agent, Disttributed/Parallel Framework for Modeling and Simulation of Biomimetic In Silico Devices Sunwoo Park 1 and C.
Advertisements

Leveraging Synchronized Clocks in Distributed Applications Edward A. Lee Robert S. Pepper Distinguished Professor UC Berkeley Swarm Lab Retreat January.
Presented by: Thabet Kacem Spring Outline Contributions Introduction Proposed Approach Related Work Reconception of ADLs XTEAM Tool Chain Discussion.
1 Towards formal manipulations of scenarios represented by High-level Message Sequence Charts Loïc Hélouet Claude Jard Benoît Caillaud IRISA/PAMPA (INRIA/CNRS/Univ.
Introduction Designing cost-sensitive real-time control systems for safety-critical applications requires a careful analysis of the cost/fault-coverage.
PTIDES Project Overview
Overview of PTIDES Project
2/11/2010 BEARS 2010 On PTIDES Programming Model John Eidson Jeff C. Jensen Edward A. Lee Slobodan Matic Jia Zou PtidyOS.
PTIDES: Programming Temporally Integrated Distributed Embedded Systems Yang Zhao, EECS, UC Berkeley Edward A. Lee, EECS, UC Berkeley Jie Liu, Microsoft.
7th Biennial Ptolemy Miniconference Berkeley, CA February 13, 2007 Causality Interfaces for Actor Networks Ye Zhou and Edward A. Lee University of California,
Integrated Design and Analysis Tools for Software-Based Control Systems Shankar Sastry (PI) Tom Henzinger Edward Lee University of California, Berkeley.
Type System, March 12, Data Types and Behavioral Types Yuhong Xiong Edward A. Lee Department of Electrical Engineering and Computer Sciences University.
Architecture-driven Modeling and Analysis By David Garlan and Bradley Schmerl Presented by Charita Feldman.
7th Biennial Ptolemy Miniconference Berkeley, CA February 13, 2007 Leveraging Synchronous Language Principles for Hybrid System Models Haiyang Zheng and.
A denotational framework for comparing models of computation Daniele Gasperini.
Using Interfaces to Analyze Compositionality Haiyang Zheng and Rachel Zhou EE290N Class Project Presentation Dec. 10, 2004.
High-level System Modeling and Power Management Techniques Jinfeng Liu Dept. of ECE, UC Irvine Sep
April 16, 2009 Center for Hybrid and Embedded Software Systems PtidyOS: An Operating System based on the PTIDES Programming.
Chess Review October 4, 2006 Alexandria, VA Edited and presented by Advanced Tool Architectures Edward A. Lee UC Berkeley.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Advanced Tool Architectures Edward A. Lee UC Berkeley.
February 12, 2009 Center for Hybrid and Embedded Software Systems Encapsulated Model Transformation Rule A transformation.
Mixing Models of Computation Jie Liu Palo Alto Research Center (PARC) 3333 Coyote Hill Rd., Palo Alto, CA joint work with Prof. Edward.
Design of Fault Tolerant Data Flow in Ptolemy II Mark McKelvin EE290 N, Fall 2004 Final Project.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Causality Interfaces and Compositional Causality Analysis Rachel Zhou UC Berkeley.
Cumulative Violation For any window size  t  Communication-Efficient Tracking for Distributed Cumulative Triggers Ling Huang* Minos Garofalakis.
Semantic Foundation of the Tagged Signal Model Xiaojun Liu Sun Microsystems, Inc. Chess Seminar February 21, 2006.
February 21, 2008 Center for Hybrid and Embedded Software Systems Mapping A Timed Functional Specification to a Precision.
NSF Foundations of Hybrid and Embedded Software Systems UC Berkeley: Chess Vanderbilt University: ISIS University of Memphis: MSI A New System Science.
SEC PI Meeting Annapolis, May 8-9, 2001 Component-Based Design of Embedded Control Systems Edward A. Lee & Jie Liu UC Berkeley with thanks to the entire.
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Department of Electrical Engineering and Computer Sciences University of California at Berkeley System-Level Types for Component-Based Design Edward A.
Department of Electrical Engineering and Computer Sciences University of California at Berkeley Concurrent Component Patterns, Models of Computation, and.
February 12, 2009 Center for Hybrid and Embedded Software Systems Model Transformation Using ERG Controller Thomas H. Feng.
Chess Review May 11, 2005 Berkeley, CA Discrete-Event Systems: Generalizing Metric Spaces and Fixed-Point Semantics Adam Cataldo Edward Lee Xiaojun Liu.
7th Biennial Ptolemy Miniconference Berkeley, CA February 13, 2007 PTIDES: A Programming Model for Time- Synchronized Distributed Real-time Systems Yang.
Model-based Analysis of Distributed Real-time Embedded System Composition Gabor Madl Sherif Abdelwahed
November 18, 2004 Embedded System Design Flow Arkadeb Ghosal Alessandro Pinto Daniele Gasperini Alberto Sangiovanni-Vincentelli
EEC-681/781 Distributed Computing Systems Lecture 10 Wenbing Zhao Cleveland State University.
Models of Computation Reading Assignment: L. Lavagno, A.S. Vincentelli and E. Sentovich, “Models of computation for Embedded System Design”
Department of Electrical Engineering and Computer Sciences University of California at Berkeley The Ptolemy II Framework for Visual Languages Xiaojun Liu.
SUPERB-IT Center For Hybrid & Embedded Software Systems COLLEGE OF ENGINEERING, UC BERKELEY July 29, 2005 SUPERB-IT.
Exceptions and Mistakes CSE788 John Eisenlohr. Big Question How can we improve the quality of concurrent software?
©Ian Sommerville 2006Software Engineering, 8th edition. Chapter 12 Slide 1 Distributed Systems Architectures.
Tufts Wireless Laboratory School Of Engineering Tufts University “Network QoS Management in Cyber-Physical Systems” Nicole Ng 9/16/20151 by Feng Xia, Longhua.
Dart: A Meta-Level Object-Oriented Framework for Task-Specific Behavior Modeling by Domain Experts R. Razavi et al..OOPSLA Workshop DSML‘ Dart:
Cloud Distributed Computing Platform 2 Content of this lecture is primarily from the book “Hadoop, The Definite Guide 2/e)
1 H ardware D escription L anguages Modeling Digital Systems.
Tufts University School Of Engineering Tufts Wireless Laboratory TWL Direction Almir Davis 09/28/20091.
VHDL IE- CSE. What do you understand by VHDL??  VHDL stands for VHSIC (Very High Speed Integrated Circuits) Hardware Description Language.
Chapter 10 Analysis and Design Discipline. 2 Purpose The purpose is to translate the requirements into a specification that describes how to implement.
Modeling Component-based Software Systems with UML 2.0 George T. Edwards Jaiganesh Balasubramanian Arvind S. Krishna Vanderbilt University Nashville, TN.
C. André, J. Boucaron, A. Coadou, J. DeAntoni,
Fall 2004EE 3563 Digital Systems Design EE 3563 VHSIC Hardware Description Language  Required Reading: –These Slides –VHDL Tutorial  Very High Speed.
The 14 th IEEE Real-Time and Embedded Technology and Applications Symposium, April 2008 Real-Time Distributed Discrete-Event Execution with Fault Tolerance.
Electrical and Computer Engineering University of Cyprus LAB 1: VHDL.
Computing For Embedded System IEEE Instrumentation and Measurement Technology Conference Budapest, Hungary, May 21-23, Author : Edward A. Lee UC.
Course: COMS-E6125 Professor: Gail E. Kaiser Student: Shanghao Li (sl2967)
What’s Ahead for Embedded Software? (Wed) Gilsoo Kim
Bin Xin, Patrick Eugster, Xiangyu Zhang Dept. of Computer Science Purdue University {xinb, peugster, Lightweight Task Graph Inference.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
T imed Languages for Embedded Software Ethan Jackson Advisor: Dr. Janos Szitpanovits Institute for Software Integrated Systems Vanderbilt University.
Control-Theoretic Approaches for Dynamic Information Assurance George Vachtsevanos Georgia Tech Working Meeting U. C. Berkeley February 5, 2003.
February 11, 2016 Center for Hybrid and Embedded Software Systems Organization Faculty Edward A. Lee, EECS Alberto Sangiovanni-Vincentelli,
February 14, 2013 Center for Hybrid and Embedded Software Systems Organization Faculty Edward A. Lee, EECS Alberto Sangiovanni-Vincentelli,
TRUST:Team for Research in Ubiquitous Secure Technologies
Shanna-Shaye Forbes Ben Lickly Man-Kit Leung
An overview of the CHESS Center
Embedded Systems: A Focus on Time
Concurrent Models of Computation for Embedded Software
An overview of the CHESS Center
Presentation transcript:

Causality Interface  Declares the dependency that output events have on input events.  D is an ordered set associated with the min ( ) and plus ( ) operators.  The dependencies between any two ports in a composition can be determined by using ( ) for serial composition and ( ) for parallel composition. c Relevant Dependency Analysis Relevant dependency analysis gives a formal framework for analyzing causality relationships to determine the minimal ordering constraints on processing events. The key idea is that events only need to be processed in time- stamp order when they are causally related. This work extends discrete-event models with the capability of mapping certain events to physical time and proposes them as a programming model, called PTIDES. We seek analysis tools and execution strategies that can preserve the deterministic behaviors specified in DE models without paying the penalty of totally ordered executions. PTIDES: Programming Temporally Integrated Distributed Embedded Systems Yang Zhao *, Edward Lee *, Jie Liu † ( * EECS, UC Berkeley, † Microsoft Research) June 18 – 20, 2006 DCOSS 2006 Discrete-Event (DE) Systems  Typically used for modeling physical systems where atomic events occur on a time line. Examples: VHDL OPNET Modeler NS-2 VisualSense  Time is only a modeling property, DE systems are primarily used in performance modeling and simulation. model of a sensor node Time Synchronization  Provides a convenient coordination mechanism for coordinated actions over distances. NTP (standard networks, ~ms) IEEE1588 (Ethernet, ~ns) RBS (wireless network)  A key question that arises in the face of such technologies is how they can change the way software is developed. PTIDES  Uses model time to define execution semantics, and constraints that bind certain model time events to physical time. PTIDES programs are constructed as networks of actors. The interface of actors contains ports. Designate a subset of the input ports to be real-time ports. Time-stamped events must be delivered to these ports before physical-time exceeds the time stamp.  The global notion of time that is intrinsic in DE models is used as a binding coordination agent.  The focus here is not about speed of execution but rather about timing determinism. Motivating Example At two distinct sensor nodes A and B we need to generate precisely timed samples under the control of software. Moreover, the devices that generate these samples provide some sensor data to the software after generating the event. A distributed DE model to be executed on a two-sensor, time- synchronized platform A and B is shown in the right figure. PTIDES wait for no man The dependency graph for computing the causality interface of a composition of actors. Relevant Dependency  Relevant dependency on any pair of input ports p 1 and p 2 specifies whether an event at p 1 will affect an output signal that may also depend on an event at p 2.  d( p 1, p 2 ) = r means any event with time stamp t 2 at p 2 can be processed when all events at p 1 are known up to time stamp t 2 −r.  d( p 1, p 2 ) = means that events at p2 can be processed without knowing anything about events at p1. p1p1 p2p2 p5p5 p6p6 p7p7 p3p3 p4p4 A B C p8p8 p9p9 p1p1 p 5 & p 6 p7p7 p9p9 p2p2 p 3 & p 8 p4p4 p1p1 p2p2 p5p5 p7p7 p3p3 p4p4 p6p6 p9p9 p8p8 Relevant Order  Relevant dependencies induce a partial order, called the relevant order, on events.  e 1 < r e 2 means that e 1 must be processed before e 2.  If neither e 1 < r e 2, nor e 2 < r e 1, i.e. e 1 || r e 2, then e 1, e 2 can be processed in any order.  This technique can be adapted to distributed execution. Towards Deployability Analysis  A key requirement for preserving runtime determinism of PTIDES programs is that each event with model time t at a real-time port must be received before the physical time exceeds t −.  When the execution time is negligible comparing to the network delays and setup time, deployability checking becomes straightforward by using the relevant order.  A full analysis, when the execution time is not negligible is ongoing.