Kenji Tei Associate Professor National Institute of Informatics, Japan

Size: px
Start display at page:

Download "Kenji Tei Associate Professor National Institute of Informatics, Japan"

Transcription

1 Kenji Tei Associate Professor National Institute of Informatics, Japan Joint work with Moeka Tanabe, Ezequiel Castellano, Leandro Nahabedian, Nicolas D Ippolito, Shinichi Honiden

2 How does the system adapt to changes? Sytems face changes at runtime Continuous real-time data cloud robots mobile Internet of Things Device failure Sudden increase of user traffic IoT devices Unstable performance Users system IaaS How do we ensure correctness of software system?

3 control Motivation Assurance at Development Time controller (software) monitor environment goal C, = E G Kind of requirements guaranteed depends on model and method adopted

4 Motivation Assurance at Development Time control controller (software) goal monitor environment c4 u4 c1 u2 c2 = c1 c4 c3 u4 u1 u2 c2 [] p1 <> p2 C E G

5 Environment Modeling for Reactive System environment movetow movetoe pickup putdown arriveatw arriveatm arriveate pickupsuccess pickupfail putsuccess putdfail

6 Environment Modeling for Reactive System models movetoe arrivem movetoe arrivee pickup pickupsuccess E = (MAP W_ROBOT). MAP=(arrive[ w] -> MAP[ w]), MAP[ w]=( move[ e] -> arrive[ m] -> MAP[ m] move[ w] -> arrive[ w] -> MAP[ w] putdown -> putsuccess -> MAP[ w] pickup -> pickupfail -> MAP[ w]), MAP[ m]=( move[ e] -> arrive[ e] -> MAP[ e] move[ w] -> arrive[ w] -> MAP[ w] putdown -> putfail -> MAP[ m] pickup -> pickupfail -> MAP[ m]), MAP[ e]=( move[ e] -> arrive[ e] -> MAP[ e] move[ w] -> arrive[ m] -> MAP[ m] putdown -> putfail -> MAP[ e] pickup -> pickupsuccess -> MAP[ e]). W_ROBOT=(arrive[ w] -> ROBOT), ROBOT= (move[direction] -> arrive[locations] -> ROBOT pickup -> (pickupsuccess -> ROBOT pickupfail -> ROBOT) putdown -> (putsuccess -> ROBOT putfail -> ROBOT) ended -> reset -> ROBOT).

7 Motivation Assurance at Development Time control controller (software) goal monitor environment c4 u4 c1 u2 c2 = c1 c4 c3 u4 u1 u2 c2 [] p1 <> p2 C E G

8

9

10 E may become invalid at runtime -> arriveatw -> movetoe -> arriveatw -> unforseen!! Motivation controller (software) control monitor environment goal c4 c1 u2 u4 c2 = c1 c4 u4 u1 System may no longer work, or may continue, but without any assurances c3 u2 c2 [] p1 <> p2

11 Environment is Uncertain Disconnection Mulfunction Sudden increase of user traffic Sensor/Actuator Unstable performance Location change User Machine Cloud / External Service Security attack Obstacles Service down Slippy floor Physical entity

12 Assuming More Realistic Environment... MAP[ w]=( move[ e] -> arrive[ m] -> MAP[ m] move[ w] -> arrive[ w] -> MAP[ w] putdown -> putsuccess -> MAP[ w] pickup -> pickupfail -> MAP[ w]),... []((AT[ w]0&&0x(move[ e]))07>0x(!arrive[ w]0w0pickupsuccess))0 []((AT[ e]0&&0x(move[ w]))07>0x(!arrive[ e]0w0putsuccess))0 [](putdown7>at[ w])0 []!(!<pickupsuccess,putsuccess>0&&0putdown)0 [](pickup7>at[ e])0 []!(<pickupsuccess,putsuccess>0&&0pickup)0 [](<ended,reset>07>0(<pickupsuccess,{reset}>0&&0<putsuccess,{reset}>))0... MAP[ w]=( move[ e] -> (arrive[ m] -> MAP[ m] arrive[ w] -> MAP[ w]) move[ w] -> arrive[ w] -> MAP[ w] putdown -> putsuccess -> MAP[ w] pickup -> pickupfail -> MAP[ w]),... []((AT[ w]0&&0x(move[ e]))07>0x(!arrive[ w]0w0pickupsuccess))0 []((AT[ e]0&&0x(move[ w]))07>0x(!arrive[ e]0w0putsuccess))0 [](putdown7>at[ w])0 []!(!<pickupsuccess,putsuccess>0&&0putdown)0 [](pickup7>at[ e])0 []!(<pickupsuccess,putsuccess>0&&0pickup)0 [](<ended,reset>07>0(<pickupsuccess,{reset}>0&&0<putsuccess,{reset}>))0

13 How Much Should We Assume? high E optimistic G rich rich risk Everything works ideally Everything can go wrong functionality low E pessimistic G poor poor

14

15 Graceful Degradation by Self-adaptation with Models C E G adaptation engine C E G controller (software) control monitor environment goal relaxed goal

16 Context of My Approach c4 u4 c1 u2 c2 c1 c4 c3 u4 u1 u2 c2 [] p1 <> p2 LTS Controller LTS Env. Model LTL Goals

17 Motivation Self-adaptation by G 1 G N Adaptation Engine 2. determine req. level cached controllers Analyzer 1. update env. model E G i knowledge C Planner 3. generate controller Decision Making Monitor Executer execution traces enactment 4. hot-swap controller C control System

18 Discrete Controller Synthesis as a Planner Feedback control for discrete event systems - driven not by time but rather by events - represented as automata, Petri nets, and the like Synthesize C by solving a control problem <E,G> (E C = G) u4 E t+1 c1 u2 c4 c2 u4 c3 c1 Controller c4 Synthesizer u2 c2 M t+1 C t+1 p1 G t+1 p2 Nicolas D'Ippolito, et al., Synthesis of Live Behaviour Models, FSE2010 Nicolas D Ippolito, et al., Synthesis of live behaviour models for fallible domains, ICSE2011

19 - Discrete Controller Synthesis- Synthesis as Two-Player Game

20 - Discrete Controller Synthesis- What s a Game? A game is composed of an arena and a winning condition

21 - Discrete Controller Synthesis- Winning Region The winning region for Player 1 is a set of states of the arena in which Player 1 can always win

22 - Discrete Controller Synthesis- Strategy A (winning) strategy for Player 1 is defined as a finite number of steps that Player 1 will take to ensure reaching the goal from the initial state, no matter what Player 2 does. Strategies for reachability are directed-acyclic graphs

23 Tool Support MTSA (Modal Transition System Analyzer) - Discrete Controller Synthesishttp://mtsa.dc.uba.ar

24 - Discrete Controller Synthesis- Enact Model Enactment framework Interpret controller model Map actions in model to concrete implementation V.Braberman et al., Controller synthesis: From modelling to enactment, ICSE 2013

25 Motivation Self-adaptation by G 1 G N Adaptation Engine 2. determine req. level cached controllers Analyzer 1. update env. model E G i knowledge C Planner 3. generate controller Decision Making Monitor Executer execution traces enactment 4. hot-swap controller C control System

26 Motivation Self-adaptation by G 1 G N Adaptation Engine 2. determine req. level cached controllers Analyzer G i Planner 1. update env. model E knowledge C 3. generate controller Monitor Executer Situation Awareness execution traces enactment C 4. hot-swap controller control System

27 - Environment Model Update - Purpose Updating LTS-based Environment Model at Runtime Situation changes consistent Inconsistent consistent Model Update

28 - Environment Model Update - Purpose Updating LTS-based Environment Model at Runtime u4 c1 E t u2 c4 c2 u4 c3 c1 Model E u2 c4 c2 t+1 execution trace ->u2->c2->-> Updater Learner c3 Online update should be accurate and efficient

29 - Environment Model Update - Proposal Existing LTS-model Update Our online LTS-model update Construct a model with all traces in the window Use gradient descent algorithm - repeat computation until convergence Update the model with the latest trace Use stochastic gradient descent-based algorithm - the latest data is used for update instead of random picking

30 - Environment Model Update - Proposal pre-condition, action, {post-condition α, β, γ, }! " e.g. arrive.w1, move.e, {arrive.m1, arrive.w1}! "

31 - Environment Model Update - Evaluation Accuracy and settling time Computational Overhead () ) ( ) ()

32 Motivation Self-adaptation by G 1 G N Adaptation Engine 2. determine req. level cached controllers Analyzer G i Planner 1. update env. model E knowledge C 3. generate controller Monitor Executer execution traces enactment 4. hot-swap controller C control System

33 Other Key Techniques 1. Environment model learning make E neither optimistic nor pessimistic 2. Goal relaxation avoid unnecessary degradation Ongoing work G 1 current level E t+1 u4 E t c1 u2 c4 c2 u4 c1 u2 c4 c2 c3 E t+1 c1 G i c4 c3 u4 execution trace ->u2->c2->-> G N u2 c2 Model Learner Relaxer G j [SAC2017] c3 3. Controller synthesis generate an assured controller u4 E t+1 c1 u2 c4 c2 u4 c3 c1 Controller c4 Synthesizer u2 c2 MC t+1 G t+1 p1 p2 4. Controller update swap controller to new one C t+1 [SEAMS2016] u4 c1 c4 u1 c2 u2

34 Context Summary Environment will change at runtime How do we ensure correctness of software? => approach enables decision making when more information is available Tech. Topics How does the system generate a correct controller for unforeseen situation? => Update the environment model and synthesize a correct controller at runtime!

Assured Graceful Degrada/on with Discrete Controller Synthesis

Assured Graceful Degrada/on with Discrete Controller Synthesis Assured Graceful Degrada/on with Discrete Controller Synthesis Kenji Tei Na/onal Ins/tute of Informa/cs Joint work with Kazuya Aizawa, Waseda University Nicolas D Ippolito, Universidad de Buenos Aires

More information

Composition-based Interaction Design for Adaptable Distributed Software Systems

Composition-based Interaction Design for Adaptable Distributed Software Systems Composition-based Interaction Design for Adaptable Distributed Software Systems Kenji Tei Assistant Professor, National Institute of Informatics Self-Introduction : Kenji Tei Assistant professor at NII

More information

Deep Reinforcement Learning

Deep Reinforcement Learning Deep Reinforcement Learning 1 Outline 1. Overview of Reinforcement Learning 2. Policy Search 3. Policy Gradient and Gradient Estimators 4. Q-prop: Sample Efficient Policy Gradient and an Off-policy Critic

More information

Behavioural Equivalences and Abstraction Techniques. Natalia Sidorova

Behavioural Equivalences and Abstraction Techniques. Natalia Sidorova Behavioural Equivalences and Abstraction Techniques Natalia Sidorova Part 1: Behavioural Equivalences p. p. The elevator example once more How to compare this elevator model with some other? The cabin

More information

Raising Level of Abstraction with Partial Models: A Vision

Raising Level of Abstraction with Partial Models: A Vision Raising Level of Abstraction with Partial Models: A Vision Marsha Chechik 1, Arie Gurfinkel 2, Sebastian Uchitel 3, and Shoham Ben-David 1 1 Department of Computer Science, University of Toronto 2 SEI/CMU

More information

Monitoring Interfaces for Faults

Monitoring Interfaces for Faults Monitoring Interfaces for Faults Aleksandr Zaks RV 05 - Fifth Workshop on Runtime Verification Joint work with: Amir Pnueli, Lenore Zuck Motivation Motivation Consider two components interacting with each

More information

Automated Software Synthesis for Complex Robotic Systems

Automated Software Synthesis for Complex Robotic Systems Automated Software Synthesis for Complex Robotic Systems Indranil Saha Department of Computer Science and Engineering Indian Institute of Technology Kanpur Indranil Saha Automated Software Synthesis for

More information

Requirements Driven Mediation for Collaborative Security. Amel Bennaceur The Open University, UK

Requirements Driven Mediation for Collaborative Security. Amel Bennaceur The Open University, UK Requirements Driven Mediation for Collaborative Security Amel Bennaceur The Open University, UK Collaborative Security Making multiple, heterogeneous, software intensive components collaborate in order

More information

Automated Formal Methods for Embedded Systems

Automated Formal Methods for Embedded Systems Automated Formal Methods for Embedded Systems Bernd Finkbeiner Universität des Saarlandes Reactive Systems Group 2011/02/03 Bernd Finkbeiner (UdS) Embedded Systems 2011/02/03 1 / 48 Automated Formal Methods

More information

A Multi-Modal Composability Framework for Cyber-Physical Systems

A Multi-Modal Composability Framework for Cyber-Physical Systems S5 Symposium June 12, 2012 A Multi-Modal Composability Framework for Cyber-Physical Systems Linh Thi Xuan Phan Insup Lee PRECISE Center University of Pennsylvania Avionics, Automotive Medical Devices Cyber-physical

More information

Automated Synthesis of Reactive Controller for Software-defined Networks

Automated Synthesis of Reactive Controller for Software-defined Networks Automated Synthesis of Reactive Controller for Software-defined Networks Anduo Wang Salar Moarref Ufuk Topcu Boon Thau Loo Andre Scedrov University of Pennsylvania 1 Networks are complicated network operator

More information

Algorithms for Evolving Data Sets

Algorithms for Evolving Data Sets Algorithms for Evolving Data Sets Mohammad Mahdian Google Research Based on joint work with Aris Anagnostopoulos, Bahman Bahmani, Ravi Kumar, Eli Upfal, and Fabio Vandin Algorithm Design Paradigms Traditional

More information

Colored Petri Net Evaluation Tool. Stephen Rojcewicz CS 2310

Colored Petri Net Evaluation Tool. Stephen Rojcewicz CS 2310 Colored Petri Net Evaluation Tool Stephen Rojcewicz CS 2310 Motivating Example (Colored Petri Nets) Consider a gesture-driven application interface. The system must detect three kinds of gestures and respond

More information

DISCRETE TIME ADAPTIVE LINEAR CONTROL

DISCRETE TIME ADAPTIVE LINEAR CONTROL DISCRETE TIME ADAPTIVE LINEAR CONTROL FOR SOFTWARE SYSTEMS Martina Maggio Lund University From wikipedia: CONTROL THEORY Control theory is an interdisciplinary branch of engineering and mathematics that

More information

Probabilistic Belief. Adversarial Search. Heuristic Search. Planning. Probabilistic Reasoning. CSPs. Learning CS121

Probabilistic Belief. Adversarial Search. Heuristic Search. Planning. Probabilistic Reasoning. CSPs. Learning CS121 CS121 Heuristic Search Planning CSPs Adversarial Search Probabilistic Reasoning Probabilistic Belief Learning Heuristic Search First, you need to formulate your situation as a Search Problem What is a

More information

Using Reinforcement Learning to Optimize Storage Decisions Ravi Khadiwala Cleversafe

Using Reinforcement Learning to Optimize Storage Decisions Ravi Khadiwala Cleversafe Using Reinforcement Learning to Optimize Storage Decisions Ravi Khadiwala Cleversafe Topics What is Reinforcement Learning? Exploration vs. Exploitation The Multi-armed Bandit Optimizing read locations

More information

MODEL BASED TEST DESIGN AT UNITY

MODEL BASED TEST DESIGN AT UNITY Sophia Antipolis, French Riviera 20-22 October 2015 MODEL BASED TEST DESIGN AT UNITY Marek Turski, Ilya Turshatov, Tomasz Paszek Unity Technologies All rights reserved Unity Technologies Provider of an

More information

Manipulator trajectory planning

Manipulator trajectory planning Manipulator trajectory planning Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering Department of Cybernetics Czech Republic http://cmp.felk.cvut.cz/~hlavac Courtesy to

More information

Model checking pushdown systems

Model checking pushdown systems Model checking pushdown systems R. Ramanujam Institute of Mathematical Sciences, Chennai jam@imsc.res.in Update Meeting, IIT-Guwahati, 4 July 2006 p. 1 Sources of unboundedness Data manipulation: integers,

More information

CERIAS Tech Report Autonomous Transaction Processing Using Data Dependency in Mobile Environments by I Chung, B Bhargava, M Mahoui, L Lilien

CERIAS Tech Report Autonomous Transaction Processing Using Data Dependency in Mobile Environments by I Chung, B Bhargava, M Mahoui, L Lilien CERIAS Tech Report 2003-56 Autonomous Transaction Processing Using Data Dependency in Mobile Environments by I Chung, B Bhargava, M Mahoui, L Lilien Center for Education and Research Information Assurance

More information

Introduction to Embedded Systems

Introduction to Embedded Systems Introduction to Embedded Systems Sanjit A. Seshia UC Berkeley EECS 149/249A Fall 2015 2008-2015: E. A. Lee, A. L. Sangiovanni-Vincentelli, S. A. Seshia. All rights reserved. Chapter 3: Discrete Dynamics,

More information

Interacting Process Classes

Interacting Process Classes The problem addressed Interacting Process Classes Abhik Roychoudhury National University of Singapore Joint work with Ankit Goel and P.S. Thiagarajan Visit to UNU-IIST May 29/30 2006 Reactive systems with

More information

Panel: Research on Complex Enterprise Systems of Systems. Complex Adaptive Systems Conference 14-NOV-2013

Panel: Research on Complex Enterprise Systems of Systems. Complex Adaptive Systems Conference 14-NOV-2013 Panel: Research on Complex Enterprise Systems of Systems Complex Adaptive Systems Conference 14-NOV-2013 Dan DeLaurentis School of Aeronautics & Astronautics and Center for Integrated Systems in Aerospace

More information

MA513: Formal Languages and Automata Theory Topic: Context-free Grammars (CFG) Lecture Number 18 Date: September 12, 2011

MA513: Formal Languages and Automata Theory Topic: Context-free Grammars (CFG) Lecture Number 18 Date: September 12, 2011 MA53: Formal Languages and Automata Theory Topic: Context-free Grammars (CFG) Lecture Number 8 Date: September 2, 20 xercise: Define a context-free grammar that represents (a simplification of) expressions

More information

A Tutorial on Runtime Verification and Assurance. Ankush Desai EECS 219C

A Tutorial on Runtime Verification and Assurance. Ankush Desai EECS 219C A Tutorial on Runtime Verification and Assurance Ankush Desai EECS 219C Outline 1. Background on Runtime Verification 2. Challenges in Programming Robotics System Drona). 3. Solution 1: Combining Model

More information

New Bandwidth Sharing and Pricing Policies to Achieve a Win-Win Situation for Cloud Provider and Tenants

New Bandwidth Sharing and Pricing Policies to Achieve a Win-Win Situation for Cloud Provider and Tenants New Bandwidth Sharing and Pricing Policies to Achieve a Win-Win Situation for Cloud Provider and Tenants Haiying Shen and Zhuozhao Li Dept. of Electrical and Computer Engineering Clemson University, SC,

More information

Compositional Model Based Software Development

Compositional Model Based Software Development Compositional Model Based Software Development Prof. Dr. Bernhard Rumpe http://www.se-rwth.de/ Seite 2 Our Working Groups and Topics Automotive / Robotics Autonomous driving Functional architecture Variability

More information

Robot Motion Planning

Robot Motion Planning Robot Motion Planning James Bruce Computer Science Department Carnegie Mellon University April 7, 2004 Agent Planning An agent is a situated entity which can choose and execute actions within in an environment.

More information

COMP 522 Modelling and Simulation model everything

COMP 522 Modelling and Simulation model everything Fall Term 2004 COMP 522 Modelling and Simulation model everything Hans Vangheluwe Modelling, Simulation and Design Lab (MSDL) School of Computer Science, McGill University, Montréal, Canada Hans Vangheluwe

More information

Dynamic Context Management and Reference Models for Dynamic Self Adaptation

Dynamic Context Management and Reference Models for Dynamic Self Adaptation Dynamic Context Management and Reference Models for Dynamic Self Adaptation Norha Villegas Icesi University (Colombia) and University of Victoria (Canada) Gabriel Tamura Icesi University (Colombia) Hausi

More information

Reducing Fair Stuttering Refinement of Transaction Systems

Reducing Fair Stuttering Refinement of Transaction Systems Reducing Fair Stuttering Refinement of Transaction Systems Rob Sumners Advanced Micro Devices robert.sumners@amd.com November 16th, 2015 Rob Sumners (AMD) Transaction Progress Checking November 16th, 2015

More information

6to4 Reverse DNS Delegation

6to4 Reverse DNS Delegation NRO Document G. Huston APNIC August 18, 2004 6to4 Reverse DNS Delegation Abstract This memo describes a potential mechanism for entering a description of DNS servers which provide "reverse lookup" of 6to4

More information

Petri Nets ~------~ R-ES-O---N-A-N-C-E-I--se-p-te-m--be-r Applications.

Petri Nets ~------~ R-ES-O---N-A-N-C-E-I--se-p-te-m--be-r Applications. Petri Nets 2. Applications Y Narahari Y Narahari is currently an Associate Professor of Computer Science and Automation at the Indian Institute of Science, Bangalore. His research interests are broadly

More information

Solace JMS Broker Delivers Highest Throughput for Persistent and Non-Persistent Delivery

Solace JMS Broker Delivers Highest Throughput for Persistent and Non-Persistent Delivery Solace JMS Broker Delivers Highest Throughput for Persistent and Non-Persistent Delivery Java Message Service (JMS) is a standardized messaging interface that has become a pervasive part of the IT landscape

More information

AirTight: A Resilient Wireless Communication Protocol for Mixed- Criticality Systems

AirTight: A Resilient Wireless Communication Protocol for Mixed- Criticality Systems AirTight: A Resilient Wireless Communication Protocol for Mixed- Criticality Systems Alan Burns, James Harbin, Leandro Indrusiak, Iain Bate, Robert Davis and David Griffin Real-Time Systems Research Group

More information

Defining a Model for Defense in Depth

Defining a Model for Defense in Depth Defining a Model for Defense in Depth James Sullivan, Michael Locasto University of Calgary LAW 2015 Sullivan / Locasto Modelling Defense in Depth LAW 2015 1 / 33 Introduction Key Problem Problem: What

More information

Introduction. Coherency vs Consistency. Lec-11. Multi-Threading Concepts: Coherency, Consistency, and Synchronization

Introduction. Coherency vs Consistency. Lec-11. Multi-Threading Concepts: Coherency, Consistency, and Synchronization Lec-11 Multi-Threading Concepts: Coherency, Consistency, and Synchronization Coherency vs Consistency Memory coherency and consistency are major concerns in the design of shared-memory systems. Consistency

More information

Low Power System-on-Chip Design Chapters 3-4

Low Power System-on-Chip Design Chapters 3-4 1 Low Power System-on-Chip Design Chapters 3-4 Tomasz Patyk 2 Chapter 3: Multi-Voltage Design Challenges in Multi-Voltage Designs Voltage Scaling Interfaces Timing Issues in Multi-Voltage Designs Power

More information

Online Learning. Lorenzo Rosasco MIT, L. Rosasco Online Learning

Online Learning. Lorenzo Rosasco MIT, L. Rosasco Online Learning Online Learning Lorenzo Rosasco MIT, 9.520 About this class Goal To introduce theory and algorithms for online learning. Plan Different views on online learning From batch to online least squares Other

More information

Cyber Security CRA Overview

Cyber Security CRA Overview Cyber Security CRA Overview Patrick McDaniel (PM, PSU) & Edward Colbert (CAM, ARL) cra.psu.edu Approved for public release; distribution is unlimited. Cyber Security Collaborative Research Alliance A Collaborative

More information

Combine the PA Algorithm with a Proximal Classifier

Combine the PA Algorithm with a Proximal Classifier Combine the Passive and Aggressive Algorithm with a Proximal Classifier Yuh-Jye Lee Joint work with Y.-C. Tseng Dept. of Computer Science & Information Engineering TaiwanTech. Dept. of Statistics@NCKU

More information

SOLUTION BRIEF Enterprise WAN Agility, Simplicity and Performance with Software-Defined WAN

SOLUTION BRIEF Enterprise WAN Agility, Simplicity and Performance with Software-Defined WAN S O L U T I O N O V E R V I E W SOLUTION BRIEF Enterprise WAN Agility, Simplicity and Performance with Software-Defined WAN Today s branch office users are consuming more wide area network (WAN) bandwidth

More information

Discrete Event Simulation & VHDL. Prof. K. J. Hintz Dept. of Electrical and Computer Engineering George Mason University

Discrete Event Simulation & VHDL. Prof. K. J. Hintz Dept. of Electrical and Computer Engineering George Mason University Discrete Event Simulation & VHDL Prof. K. J. Hintz Dept. of Electrical and Computer Engineering George Mason University Discrete Event Simulation Material from VHDL Programming with Advanced Topics by

More information

Interdomain Routing Design for MobilityFirst

Interdomain Routing Design for MobilityFirst Interdomain Routing Design for MobilityFirst October 6, 2011 Z. Morley Mao, University of Michigan In collaboration with Mike Reiter s group 1 Interdomain routing design requirements Mobility support Network

More information

Joint Server Selection and Routing for Geo-Replicated Services

Joint Server Selection and Routing for Geo-Replicated Services Joint Server Selection and Routing for Geo-Replicated Services Srinivas Narayana Joe Wenjie Jiang, Jennifer Rexford and Mung Chiang Princeton University 1 Large-scale online services Search, shopping,

More information

Algorithms for Sensor-Based Robotics: Sampling-Based Motion Planning

Algorithms for Sensor-Based Robotics: Sampling-Based Motion Planning Algorithms for Sensor-Based Robotics: Sampling-Based Motion Planning Computer Science 336 http://www.cs.jhu.edu/~hager/teaching/cs336 Professor Hager http://www.cs.jhu.edu/~hager Recall Earlier Methods

More information

By: Chaitanya Settaluri Devendra Kalia

By: Chaitanya Settaluri Devendra Kalia By: Chaitanya Settaluri Devendra Kalia What is an embedded system? An embedded system Uses a controller to perform some function Is not perceived as a computer Software is used for features and flexibility

More information

Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks

Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks Dongyu Qiu and R. Srikant Coordinated Science Laboratory University of Illinois at Urbana-Champaign CSL, UIUC p.1/22 Introduction

More information

Modeling and Verification of Networkon-Chip using Constrained-DEVS

Modeling and Verification of Networkon-Chip using Constrained-DEVS Modeling and Verification of Networkon-Chip using Constrained-DEVS Soroosh Gholami Hessam S. Sarjoughian School of Computing, Informatics, and Decision Systems Engineering Arizona Center for Integrative

More information

Game Level Layout from Design Specification

Game Level Layout from Design Specification Copyright of figures and other materials in the paper belongs original authors. Game Level Layout from Design Specification Chongyang Ma et al. EUROGRAPHICS 2014 Presented by YoungBin Kim 2015. 01. 13

More information

Time-annotated game graphs for synthesis from abstracted systems

Time-annotated game graphs for synthesis from abstracted systems Time-annotated game graphs for synthesis from abstracted systems Scott C. Livingston Abstract The construction of discrete abstractions is a crucial part of many methods for control synthesis of hybrid

More information

Lecture 9 Extensions and Open Problems

Lecture 9 Extensions and Open Problems Lecture 9 Extensions and Open Problems Richard M. Murray Nok Wongpiromsarn Ufuk Topcu California Institute of Technology EECI, 18 May 2012 Outline: Review key concepts from the course Discussion open issues,

More information

Angelic Hierarchical Planning. Bhaskara Marthi Stuart Russell Jason Wolfe Willow Garage UC Berkeley UC Berkeley

Angelic Hierarchical Planning. Bhaskara Marthi Stuart Russell Jason Wolfe Willow Garage UC Berkeley UC Berkeley Angelic Hierarchical Planning Bhaskara Marthi Stuart Russell Jason Wolfe Willow Garage UC Berkeley UC Berkeley 1 Levels of Decision-Making Task: which object to move where? Grasp planner: where to grasp

More information

Intelligent Behavior Correctness and perceived correctness of continuous execution of synthesized plans

Intelligent Behavior Correctness and perceived correctness of continuous execution of synthesized plans Intelligent Behavior Correctness and perceived correctness of continuous execution of synthesized plans Vasu Raman Cornell University Joint work with Cameron Finucane, Gangyuan Jing and Hadas Kress-Gazit

More information

Topics in Computer Animation

Topics in Computer Animation Topics in Computer Animation Animation Techniques Artist Driven animation The artist draws some frames (keyframing) Usually in 2D The computer generates intermediate frames using interpolation The old

More information

Improving Scalability of Processor Utilization on Heavily-Loaded Servers with Real-Time Scheduling

Improving Scalability of Processor Utilization on Heavily-Loaded Servers with Real-Time Scheduling Improving Scalability of Processor Utilization on Heavily-Loaded Servers with Real-Time Scheduling Eiji Kawai, Youki Kadobayashi, Suguru Yamaguchi Nara Institute of Science and Technology JAPAN Motivation

More information

Further Topics in Modelling & Verification

Further Topics in Modelling & Verification Further Topics in Modelling & Verification Thursday Oct 09, 2014 Philipp Rümmer Uppsala University Philipp.Ruemmer@it.uu.se 1/34 Recap: Timed automata (TA) 2/34 Recap: Properties 3/34 Questions about TA

More information

From Communicating Machines to Graphical Choreographies

From Communicating Machines to Graphical Choreographies From Communicating Machines to Graphical Choreographies Julien Lange joint work with Emilio Tuosto and Nobuko Yoshida July 2015 alignment separation cohesion Single bird» local behaviour» CFSM Flock» global

More information

New York University Computer Science Department Courant Institute of Mathematical Sciences

New York University Computer Science Department Courant Institute of Mathematical Sciences New York University Computer Science Department Courant Institute of Mathematical Sciences Course Title: Data Communication & Networks Course Number: g22.2662-001 Instructor: Jean-Claude Franchitti Session:

More information

Model-based Analysis of Event-driven Distributed Real-time Embedded Systems

Model-based Analysis of Event-driven Distributed Real-time Embedded Systems Model-based Analysis of Event-driven Distributed Real-time Embedded Systems Gabor Madl Committee Chancellor s Professor Nikil Dutt (Chair) Professor Tony Givargis Professor Ian Harris University of California,

More information

Efficient Power Management in Wireless Communication

Efficient Power Management in Wireless Communication Efficient Power Management in Wireless Communication R.Saranya 1, Mrs.J.Meena 2 M.E student,, Department of ECE, P.S.R.College of Engineering, sivakasi, Tamilnadu, India 1 Assistant professor, Department

More information

THE APPROACH TO PROGRAMMING AGENT-BASED SYSTEMS. Dmitry Cheremisinov Liudmila Cheremisinova

THE APPROACH TO PROGRAMMING AGENT-BASED SYSTEMS. Dmitry Cheremisinov Liudmila Cheremisinova THE APPROACH TO PROGRAMMING AGENT-BASED SYSTEMS Dmitry Cheremisinov Liudmila Cheremisinova The United Institute of Informatics Problems of National Academy of Sciences of Belarus 8-th International Workshop

More information

A New Optimal State Assignment Technique for Partial Scan Designs

A New Optimal State Assignment Technique for Partial Scan Designs A New Optimal State Assignment Technique for Partial Scan Designs Sungju Park, Saeyang Yang and Sangwook Cho The state assignment for a finite state machine greatly affects the delay, area, and testabilities

More information

Principles of Computer Game Design and Implementation. Revision Lecture

Principles of Computer Game Design and Implementation. Revision Lecture Principles of Computer Game Design and Implementation Revision Lecture Introduction Brief history; game genres Game structure A series of interesting choices Series of convexities Variable difficulty increase

More information

Composability Test of BOM based models using Petri Nets

Composability Test of BOM based models using Petri Nets I. Mahmood, R. Ayani, V. Vlassov and F. Moradi 7 Composability Test of BOM based models using Petri Nets Imran Mahmood 1, Rassul Ayani 1, Vladimir Vlassov 1, and Farshad Moradi 2 1 Royal Institute of Technology

More information

Boolean network robotics

Boolean network robotics Boolean network robotics An example of ongoing robotics research Andrea Roli andrea.roli@unibo.it DISI - Dept. of Computer Science and Engineering Campus of Cesena Alma Mater Studiorum Università di Bologna

More information

Lecture 18: Planning and plan execution, applications

Lecture 18: Planning and plan execution, applications Lecture 18: Planning and plan execution, applications Planning, plan execution, replanning Planner as a part of an autonomous robot: robot architectures The subsumption architecture The 3-tier architecture:

More information

Monte Carlo Tree Search PAH 2015

Monte Carlo Tree Search PAH 2015 Monte Carlo Tree Search PAH 2015 MCTS animation and RAVE slides by Michèle Sebag and Romaric Gaudel Markov Decision Processes (MDPs) main formal model Π = S, A, D, T, R states finite set of states of the

More information

Computer Architecture and Engineering CS152 Quiz #5 April 27th, 2016 Professor George Michelogiannakis Name: <ANSWER KEY>

Computer Architecture and Engineering CS152 Quiz #5 April 27th, 2016 Professor George Michelogiannakis Name: <ANSWER KEY> Computer Architecture and Engineering CS152 Quiz #5 April 27th, 2016 Professor George Michelogiannakis Name: This is a closed book, closed notes exam. 80 Minutes 19 pages Notes: Not all questions

More information

My Lessons Learned in Security Awareness. Pedro Serrano, CISSP Security Architect Cimarex Energy

My Lessons Learned in Security Awareness. Pedro Serrano, CISSP Security Architect Cimarex Energy My Lessons Learned in Security Awareness Pedro Serrano, CISSP Security Architect Cimarex Energy Phishing, how ransomware and malware get delivered! 215.3 Billion emails sent and received per day in 2016!

More information

Reinforcement Learning for Adaptive Routing of Autonomous Vehicles in Congested Networks

Reinforcement Learning for Adaptive Routing of Autonomous Vehicles in Congested Networks Reinforcement Learning for Adaptive Routing of Autonomous Vehicles in Congested Networks Jonathan Cox Aeronautics & Astronautics Brandon Jennings Mechanical Engineering Steven Krukowski Aeronautics & Astronautics

More information

Efficient Synthesis of Production Schedules by Optimization of Timed Automata

Efficient Synthesis of Production Schedules by Optimization of Timed Automata Efficient Synthesis of Production Schedules by Optimization of Timed Automata Inga Krause Institute of Automatic Control Engineering Technische Universität München inga.krause@mytum.de Joint Advanced Student

More information

10703 Deep Reinforcement Learning and Control

10703 Deep Reinforcement Learning and Control 10703 Deep Reinforcement Learning and Control Russ Salakhutdinov Machine Learning Department rsalakhu@cs.cmu.edu Policy Gradient I Used Materials Disclaimer: Much of the material and slides for this lecture

More information

General Framework for Secure IoT Systems

General Framework for Secure IoT Systems General Framework for Secure IoT Systems National center of Incident readiness and Strategy for Cybersecurity (NISC) Government of Japan August 26, 2016 1. General Framework Objective Internet of Things

More information

Overview. Background: Sybil Attack. Background: Defending Against Sybil Attack. Social Networks. Multiplayer Games. Class Feedback Discussion

Overview. Background: Sybil Attack. Background: Defending Against Sybil Attack. Social Networks. Multiplayer Games. Class Feedback Discussion Overview Social Networks Multiplayer Games Class Feedback Discussion L-27 Social Networks and Other Stuff 2 Background: Sybil Attack Sybil attack: Single user pretends many fake/sybil identities Creating

More information

EECS 482 Introduction to Operating Systems

EECS 482 Introduction to Operating Systems EECS 482 Introduction to Operating Systems Winter 2018 Baris Kasikci (Thanks, Harsha Madhyastha and Jason Flinn for the slides!) Distributed file systems Remote storage of data that appears local Examples:

More information

Program verification. Generalities about software Verification Model Checking. September 20, 2016

Program verification. Generalities about software Verification Model Checking. September 20, 2016 Program verification Generalities about software Verification Model Checking Laure Gonnord David Monniaux September 20, 2016 1 / 43 The teaching staff Laure Gonnord, associate professor, LIP laboratory,

More information

Important Lessons. Today's Lecture. Two Views of Distributed Systems

Important Lessons. Today's Lecture. Two Views of Distributed Systems Important Lessons Replication good for performance/ reliability Key challenge keeping replicas up-to-date Wide range of consistency models Will see more next lecture Range of correctness properties L-10

More information

Roaming with UltraWAPs

Roaming with UltraWAPs Roaming with UltraWs Rob Clark www.freenet-antennas.com July-2006 Summary It is often desired to design a wireless network that supports seamless roaming of mobile computers between Access Point () base

More information

The Embedded Systems Design Challenge. EPFL Verimag

The Embedded Systems Design Challenge. EPFL Verimag The Embedded Systems Design Challenge Tom Henzinger Joseph Sifakis EPFL Verimag Formal Methods: A Tale of Two Cultures Engineering Computer Science Differential Equations Linear Algebra Probability Theory

More information

Linking Natural Language to Action. Advisors: George Pappas and Norm Badler

Linking Natural Language to Action. Advisors: George Pappas and Norm Badler Linking Natural Language to Action Hadas Kress-Gazit Jan M. Allbeck Advisors: George Pappas and Norm Badler SUBTLE MURI LTL and PAR Integration Pragmatics->PAR->LTL->PAR Commands in the form of PARs will

More information

Combining Declarative and Procedural Views in the Specification and Analysis of Product Families FMSPLE 2013

Combining Declarative and Procedural Views in the Specification and Analysis of Product Families FMSPLE 2013 Combining Declarative and Procedural Views in the Specification and Analysis of Product Families Maurice H. ter Beek ISTI CNR, Pisa, Italy joint work with Alberto Lluch Lafuente Marinella Petrocchi IMT,

More information

Hierarchical Dynamic Models for Verifying Parallel Distributed Real-Time Systems

Hierarchical Dynamic Models for Verifying Parallel Distributed Real-Time Systems Hierarchical Dynamic Models for Verifying Parallel Distributed Real-Time Systems Heinz Schmidt Centre for Distributed Systems and Software Engineering Monash University 11/2005 1 Overview Architectural

More information

A BGP-Based Mechanism for Lowest-Cost Routing

A BGP-Based Mechanism for Lowest-Cost Routing A BGP-Based Mechanism for Lowest-Cost Routing Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, Scott Shenker Presented by: Tony Z.C Huang Theoretical Motivation Internet is comprised of separate administrative

More information

Tradeoff Evaluation. Comparison between CB-R and CB-A as they only differ for this aspect.

Tradeoff Evaluation. Comparison between CB-R and CB-A as they only differ for this aspect. Tradeoff Evaluation Comparison between C2PL and CB-A, as both: Allow intertransaction caching Don t use propagation Synchronously activate consistency actions Tradeoff Evaluation Comparison between CB-R

More information

Research Collection. Formal background and algorithms. Other Conference Item. ETH Library. Author(s): Biere, Armin. Publication Date: 2001

Research Collection. Formal background and algorithms. Other Conference Item. ETH Library. Author(s): Biere, Armin. Publication Date: 2001 Research Collection Other Conference Item Formal background and algorithms Author(s): Biere, Armin Publication Date: 2001 Permanent Link: https://doi.org/10.3929/ethz-a-004239730 Rights / License: In Copyright

More information

Robotics Tasks. CS 188: Artificial Intelligence Spring Manipulator Robots. Mobile Robots. Degrees of Freedom. Sensors and Effectors

Robotics Tasks. CS 188: Artificial Intelligence Spring Manipulator Robots. Mobile Robots. Degrees of Freedom. Sensors and Effectors CS 188: Artificial Intelligence Spring 2006 Lecture 5: Robot Motion Planning 1/31/2006 Dan Klein UC Berkeley Many slides from either Stuart Russell or Andrew Moore Motion planning (today) How to move from

More information

Combining Induction, Deduction and Structure for Synthesis

Combining Induction, Deduction and Structure for Synthesis Combining Induction, Deduction and Structure for Synthesis Sanjit A. Seshia Associate Professor EECS Department UC Berkeley Students: S. Jha, B. Brady, J. Kotker, W.Li Collaborators: R. Bryant, S. Gulwani,

More information

THE ESSENCE OF DATA GOVERNANCE ARTICLE

THE ESSENCE OF DATA GOVERNANCE ARTICLE THE ESSENCE OF ARTICLE OVERVIEW The availability of timely and accurate data is an essential element of the everyday operations of many organizations. Equally, an inability to capitalize on data assets

More information

Temporal logic-based decision making and control. Jana Tumova Robotics, Perception, and Learning Department (RPL)

Temporal logic-based decision making and control. Jana Tumova Robotics, Perception, and Learning Department (RPL) Temporal logic-based decision making and control Jana Tumova Robotics, Perception, and Learning Department (RPL) DARPA Urban Challenge 2007 2 Formal verification Does a system meet requirements? System

More information

Topics in AI (CPSC 532L): Multimodal Learning with Vision, Language and Sound. Lecture 12: Deep Reinforcement Learning

Topics in AI (CPSC 532L): Multimodal Learning with Vision, Language and Sound. Lecture 12: Deep Reinforcement Learning Topics in AI (CPSC 532L): Multimodal Learning with Vision, Language and Sound Lecture 12: Deep Reinforcement Learning Types of Learning Supervised training Learning from the teacher Training data includes

More information

A Self-Organising Solution to the Collective Sort Problem in Distributed Tuple Spaces

A Self-Organising Solution to the Collective Sort Problem in Distributed Tuple Spaces A Self-Organising Solution to the Collective Sort Problem in Distributed Tuple Spaces Mirko Viroli Matteo Casadei Luca Gardelli Alma Mater Studiorum Università di Bologna {mirko.viroli,m.casadei,luca.gardelli}@unibo.it

More information

SDL. Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 年 10 月 18 日. technische universität dortmund

SDL. Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 年 10 月 18 日. technische universität dortmund 12 SDL Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 12 2017 年 10 月 18 日 Springer, 2010 These slides use Microsoft clip arts. Microsoft copyright restrictions apply. Models

More information

HARDWARE SOFTWARE CO-DESIGN

HARDWARE SOFTWARE CO-DESIGN HARDWARE SOFTWARE CO-DESIGN BITS Pilani Dubai Campus Dr Jagadish Nayak Models and Architecture BITS Pilani Dubai Campus Models and Architecture Model: a set of functional objects and rules for composing

More information

Digitaalsüsteemide disain

Digitaalsüsteemide disain IAY 6 Digitaalsüsteemide disain Register Transfer Level Design. FSM Synthesis. Alexander Sudnitson Tallinn University of Technology Register Transfer Level The Register Transfer Level (RTL) is characterized

More information

A Secure and Dynamic Multi-keyword Ranked Search Scheme over Encrypted Cloud Data

A Secure and Dynamic Multi-keyword Ranked Search Scheme over Encrypted Cloud Data An Efficient Privacy-Preserving Ranked Keyword Search Method Cloud data owners prefer to outsource documents in an encrypted form for the purpose of privacy preserving. Therefore it is essential to develop

More information

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer

More information

Conditional Random Fields - A probabilistic graphical model. Yen-Chin Lee 指導老師 : 鮑興國

Conditional Random Fields - A probabilistic graphical model. Yen-Chin Lee 指導老師 : 鮑興國 Conditional Random Fields - A probabilistic graphical model Yen-Chin Lee 指導老師 : 鮑興國 Outline Labeling sequence data problem Introduction conditional random field (CRF) Different views on building a conditional

More information

Performance and cost effectiveness of caching in mobile access networks

Performance and cost effectiveness of caching in mobile access networks Performance and cost effectiveness of caching in mobile access networks Jim Roberts (IRT-SystemX) joint work with Salah Eddine Elayoubi (Orange Labs) ICN 2015 October 2015 The memory-bandwidth tradeoff

More information

CLAN: A Tool for Contract Analysis and Conflict Discovery

CLAN: A Tool for Contract Analysis and Conflict Discovery CLAN: A Tool for Contract Analysis and Conflict Discovery Stephen Fenech 1, Gordon J. Pace 1, and Gerardo Schneider 2 1 Dept. of Computer Science, University of Malta, Malta 2 Dept. of Informatics, University

More information