Oracle-based Mode-change Propagation in Hierarchical Components.
|
|
- MargaretMargaret Thomas
- 5 years ago
- Views:
Transcription
1 Oracle-based Mode-change Propagation in Hierarchical Components. Tomas Pop, Frantisek Plasil, Matej Outly, Michal Malohlava, Tomas Bures CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics
2 Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 2 Motivation Example Civilization search
3 Motivation Example Civilization search Phases of execution Init, Search, TDisc Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 3
4 Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 4 Motivation Example Civilization search Several phases of execution INIT, Search, TDisc Corresponding architecture Architecture variants
5 Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 5 Motivation Example Civilization search Several phases of execution INIT, Search, TDisc Corresponding architecture Architecture variants
6 Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 6 Motivation Mass production of hardware Cents matter Optimization for minimal software resource demands Use only what is needed Allows for deployment on low-cost hardware Mode switching at run-time
7 Problem Statement Switching of architecture variants (modes) in component based control systems is challenging Must not be demanding at run-time Mode relevant information is spread among multiple components E.g., state of multiple sensors and other components Handwritten architecture modifications are complex and error prone Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 7
8 Challenges Relation specification in respect to composability Generation of mode-transition automata for composed system Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 8
9 What Will Be the Seminar About? Formal model allowing for an efficient mode switching in hierarchical component system Composability of the mechanism Not polluting existing interfaces Feasible and predictable time and space complexity Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 9
10 Strategy Identify relevant part of state of component Set of properties Model relations between these Make it composable in the hierarchy Determine active sub-components based on mode (property of the parent component) Generate mode transition automata for the whole application (at deployment time) <Author>, D3S Seminar, <Date> <Title> 10
11 Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 11 Proposed Approach - Property networks Component is associated with a set of properties
12 Proposed Approach - Property networks Components are associated with a set of properties Property values are bounded by relations Directed graph Propagation Local change has an impact where relevant Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 12
13 Mapping State of Network to Arch. Variant Each component has a mode property Component mode is Set of child subcomponents used Component attributes e.g. real-time scheduling info Local change of property value Is propagated by the network Influence valuation of properties where relevant Also the ones representing mode Determines new application architecture Change propagation possibly demanding But can be pre-computed to an Oracle at deployment time Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 13
14 Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 14 Proposed Approach - Property networks Interpretation C 1 - capplication C 2 cbrain C 3 csearchstrategy p 4 mode Brain p 5 groundtype p 6 mode SearchStrategy
15 After a Change Run is started Until the network stabilize No further changes Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 15
16 Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 16 Network Run Stabilization a) will stabilize b) will stabilize c) will not stabilize
17 Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 17 Triggering Event and Network Run Event Property value assignment from component code E.g., color seen by a camera changes The network propagates the event until it stabilizes (network run) Relation with changed inputs is reevaluated Similar to shifting tokens in Petri Nets Stabilization - no further changes of property valuations If not, bad relation design (oscillation) Checked by development tools
18 Worst Case Property Network Run Length Exponential in the number of properties Possibly all the possible valuations Knowing initial state and all the possible events, all the possible runs can precomputed at deployment time Oracle (mode transition automata) At run-time, the oracle is queried in a constant time Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 18
19 Oracle Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 19
20 At Run-time - Overview Component can change value of a property that is associated with it via API After each change The oracle is queried for new valuation of all properties The valuation is changed Runtime framework takes responsibility for modifications of the architecture according to oracle hints Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 20
21 Implementation and Experience Introduction to existing SOFA-HI component system takes a feasible effort Tools for network relations design necessary Checking for well-formed property networks No oscillation Model seems to be intuitive In the case study, 13 properties <Author>, D3S Seminar, <Date> <Title> 21
22 Overview Property networks allows for highly deterministic architectural modifications Pre-computed oracle New variant in constant time Oscillation is not possible at runtime Time and space complexity is feasible Constant time and 2kB for presented case-study Does not pollute interfaces and business logic It is orthogonal to them <Author>, D3S Seminar, <Date> <Title> 22
23 Thank You, Questions Tomas Pop, CBSE 2012 Oracle-based Mode-change Propagation in Hierarchical Components 23
Hierarchical vs. Flat Component Models
Hierarchical vs. Flat Component Models František Plášil, Petr Hnětynka DISTRIBUTED SYSTEMS RESEARCH GROUP http://nenya.ms.mff.cuni.cz Outline Component models (CM) Desired Features Flat vers. hierarchical
More information6 NFA and Regular Expressions
Formal Language and Automata Theory: CS21004 6 NFA and Regular Expressions 6.1 Nondeterministic Finite Automata A nondeterministic finite automata (NFA) is a 5-tuple where 1. is a finite set of states
More informationApplying Componentbased. Engineering in On-board Software
Applying Componentbased Software Engineering in On-board Software 22.10.2008 SciSys Bristol, UK Aleš Plšek, ales.plsek@inria.fr Frédéric Loiret Michal Malohlava Lionel Seinturier Philippe Merle 1 INRIA
More informationIntroduction & Formal Methods
Introduction & Formal Methods http://d3s.mff.cuni.cz Jan Kofroň CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics Introduction to dependable systems NSWE 002 What you learn: Dependable systems
More informationTowards Dependable Emergent Ensembles of Components: The DEECo Component Model
Towards Dependable Emergent Ensembles of Components: The DEECo Component Model http://d3s.mff.cuni.cz Jaroslav Keznikl, Tomáš Bureš, František Plášil, Michal Kit bures@d3s.mff.cuni.cz CHARLES UNIVERSITY
More informationA B2B Search Engine. Abstract. Motivation. Challenges. Technical Report
Technical Report A B2B Search Engine Abstract In this report, we describe a business-to-business search engine that allows searching for potential customers with highly-specific queries. Currently over
More informationIntroduction 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 informationTransforming Cyber-Physical System Models
Transforming Cyber-Physical System Models Nathan Jarus Ph.D. Candidate Department of Electrical and Computer Engineering Advisors: Dr. Sahra Sedigh Sarvestani and Dr. Ali Hurson ISC Graduate Research Symposium
More informationPetri Nets: Properties, Applications, and Variations. Matthew O'Brien University of Pittsburgh
Petri Nets: Properties, Applications, and Variations Matthew O'Brien University of Pittsburgh Introduction A Petri Net is a graphical and mathematical modeling tool used to describe and study information
More informationTowards an Integrated System Model for Testing and Verification
Towards an Integrated System Model for Testing and Verification Benjamin Hummel and Peter Braun MiSE 2008 Domain Development of controller software for production machines Special case of mechatronic system
More informationCSE 530A. B+ Trees. Washington University Fall 2013
CSE 530A B+ Trees Washington University Fall 2013 B Trees A B tree is an ordered (non-binary) tree where the internal nodes can have a varying number of child nodes (within some range) B Trees When a key
More informationResource Sharing in QPN-based Performance Models
WDS'08 Proceedings of Contributed Papers, Part I, 202 207, 2008. ISBN 978-80-7378-065-4 MATFYZPRESS Resource Sharing in QPN-based Performance Models V. Babka Charles University Prague, Faculty of Mathematics
More informationGeneralization of Hierarchical Crisp Clustering Algorithms to Fuzzy Logic
Generalization of Hierarchical Crisp Clustering Algorithms to Fuzzy Logic Mathias Bank mathias.bank@uni-ulm.de Faculty for Mathematics and Economics University of Ulm Dr. Friedhelm Schwenker friedhelm.schwenker@uni-ulm.de
More informationESET Remote Administrator 6. Version 6.0 Product Details
ESET Remote Administrator 6 Version 6.0 Product Details ESET Remote Administrator 6.0 is a successor to ESET Remote Administrator V5.x, however represents a major step forward, completely new generation
More informationSpecification and Generation of Environment for Model Checking of Software Components *
Specification and Generation of Environment for Model Checking of Software Components * Pavel Parizek 1, Frantisek Plasil 1,2 1 Charles University, Faculty of Mathematics and Physics, Department of Software
More informationGenerating Petri Nets from AADL descriptions. Thomas Vergnaud
Generating Petri Nets from AADL descriptions Designing a Distribution Runtime for the AADL work at ENST focuses on the building of communication middlewares manage communication
More informationUsing Hybrid Automata for Early Spacecraft Design Evaluation
Seminar Operating Systems: Winter Semester 18/19 Using Hybrid Automata for Early Spacecraft Design Evaluation Jafar Akhundov Motivation Motivation: Spacecraft Modelling Gaia - mission to chart a 3d-map
More informationWSN Routing Protocols
WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before
More informationColored 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 informationSyntax Analysis Part I
Syntax Analysis Part I Chapter 4: Context-Free Grammars Slides adapted from : Robert van Engelen, Florida State University Position of a Parser in the Compiler Model Source Program Lexical Analyzer Token,
More informationExercise Unit 2: Modeling Paradigms - RT-UML. UML: The Unified Modeling Language. Statecharts. RT-UML in AnyLogic
Exercise Unit 2: Modeling Paradigms - RT-UML UML: The Unified Modeling Language Statecharts RT-UML in AnyLogic Simulation and Modeling I Modeling with RT-UML 1 RT-UML: UML Unified Modeling Language a mix
More informationChapter 4. Capturing the Requirements. 4th Edition. Shari L. Pfleeger Joanne M. Atlee
Chapter 4 Capturing the Requirements Shari L. Pfleeger Joanne M. Atlee 4th Edition It is important to have standard notations for modeling, documenting, and communicating decisions Modeling helps us to
More informationPath-planning for Multiple Robots
Path-planning for Multiple Robots RNDr. Pavel Surynek, Ph.D. Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University in Prague http://ktiml.mff.cuni.cz/~surynek
More informationThe Ocarina Tool Suite. Thomas Vergnaud
The Ocarina Tool Suite Motivation 2 ENST is developing a middleware architecture: PolyORB generic, configurable, interoperable enables middleware verification create a tool chain
More informationConstraint-based Generation of Connectors
Constraint-based Generation of Connectors Tomas Bures Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic Abstract. In this paper we discuss the a typical use-case of connector
More informationDependable and Secure Systems Dependability
Dependable and Secure Systems Dependability Master of Science in Embedded Computing Systems Quantitative Dependability Analysis with Stochastic Activity Networks: the Möbius Tool Andrea Domenici DII, Università
More informationAssignment 4 CSE 517: Natural Language Processing
Assignment 4 CSE 517: Natural Language Processing University of Washington Winter 2016 Due: March 2, 2016, 1:30 pm 1 HMMs and PCFGs Here s the definition of a PCFG given in class on 2/17: A finite set
More informationHardware-Software Codesign
Hardware-Software Codesign 8. Performance Estimation Lothar Thiele 8-1 System Design specification system synthesis estimation -compilation intellectual prop. code instruction set HW-synthesis intellectual
More informationBy: 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, Phase Transitions, Constraint and Complexity Analyses
Flexible Methods for Multi-agent distributed resource Allocation by Exploiting Phase Transitions - Modeling, Phase Transitions, Constraint and Complexity Analyses Weixiong Zhang (PI) Washington University
More informationsystems & research project
class 4 systems & research project prof. HTTP://DASLAB.SEAS.HARVARD.EDU/CLASSES/CS265/ index index knows order about the data data filtering data: point/range queries index data A B C sorted A B C initial
More informationOptimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling
The 39th IEEE Real-Time Systems Symposium (RTSS 18) Optimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling Shamit Bansal, Yecheng Zhao, Haibo Zeng,
More informationQoSPL: A QoS-Driven Software Product Line Engineering Framework for Distributed Real-time and Embedded Systems
QoSPL: A QoS-Driven Software Product Line Engineering Framework for Distributed Real-time and Embedded Systems Shih-Hsi Alex Liu 1, Barrett R. Bryant 1, Jeff Gray 1, Rajeev Raje 2, Mihran Tuceryan 2, Andrew
More informationFormal Languages and Compilers Lecture IV: Regular Languages and Finite. Finite Automata
Formal Languages and Compilers Lecture IV: Regular Languages and Finite Automata Free University of Bozen-Bolzano Faculty of Computer Science POS Building, Room: 2.03 artale@inf.unibz.it http://www.inf.unibz.it/
More informationPetri Nets ee249 Fall 2000
Petri Nets ee249 Fall 2000 Marco Sgroi Most slides borrowed from Luciano Lavagno s lecture ee249 (1998) 1 Models Of Computation for reactive systems Main MOCs: Communicating Finite State Machines Dataflow
More information!! What is virtual memory and when is it useful? !! What is demand paging? !! When should pages in memory be replaced?
Chapter 10: Virtual Memory Questions? CSCI [4 6] 730 Operating Systems Virtual Memory!! What is virtual memory and when is it useful?!! What is demand paging?!! When should pages in memory be replaced?!!
More informationSpecification and Generation of Environment for Model Checking of Software Components
Specification and Generation of Environment for Model Checking of Software Components Pavel Parizek a,1, Frantisek Plasil a,b,1 a Department of Software Engineering Charles University, Faculty of Mathematics
More informationIII. CONCEPTS OF MODELLING II.
III. CONCEPTS OF MODELLING II. 5. THE MODELLING PROCEDURE 6. TYPES OF THE MODELS 7. SELECTION OF MODEL TYPE 8. SELECTION OF MODEL COMPLEXITY AND STRUCTURE 1 5. MODELLING PROCEDURE Three significant steps
More informationDesign and Implementation of Cost Effective MIS for Universities
Fourth LACCEI International Latin American and Caribbean Conference for Engineering and Technology (LACCET 2006) Breaking Frontiers and Barriers in Engineering: Education, Research and Practice 21-23 June
More informationA DEVS LIBRARY FOR LAYERED QUEUING NETWORKS
A DEVS LIBRARY FOR LAYERED QUEUING NETWORKS Dorin B. Petriu and Gabriel Wainer Department of Systems and Computer Engineering Carleton University, 1125 Colonel By Drive Ottawa, Ontario K1S 5B6, Canada.
More informationEvolution of XML Applications
Evolution of XML Applications University of Technology Sydney, Australia Irena Mlynkova 9.11. 2011 XML and Web Engineering Research Group Department of Software Engineering Faculty of Mathematics and Physics
More informationDependable and Secure Systems Dependability Master of Science in Embedded Computing Systems
Dependable and Secure Systems Dependability Master of Science in Embedded Computing Systems Quantitative Dependability Analysis with Stochastic Activity Networks: the Möbius Tool April 2016 Andrea Domenici
More informationExplicit Abstraction & Refinement. Single Agent Search COMP Prof. Nathan Sturtevant Lecture 16. Clique Abstraction (Sturtevant & Buro, 05)
Explicit Abstraction & Refinement Single Agent Search COMP-70- Prof. Nathan Sturtevant Lecture 6 Can t* use implicit abstractions in graph-based domains such as pathfinding Build explicit abstraction Pre-processing
More informationAnalysis of Broadcast Authentication Mechanism in Selected Network Topologies
RADIOENGINEERING, VOL. 20, NO. 1, APRIL 2011 167 Analysis of Broadcast Authentication Mechanism in Selected Network Topologies Tomas VANEK, Matej ROHLIK Dept. of Telecommunication Engineering, Czech Technical
More informationCSE 504: Compiler Design. Runtime Environments
Runtime Environments Pradipta De pradipta.de@sunykorea.ac.kr Current Topic Procedure Abstractions Mechanisms to manage procedures and procedure calls from compiler s perspective Runtime Environment Choices
More informationOutline. Petri nets. Introduction Examples Properties Analysis techniques. 1 EE249Fall04
Outline Petri nets Introduction Examples Properties Analysis techniques 1 Petri Nets (PNs) Model introduced by C.A. Petri in 1962 Ph.D. Thesis: Communication with Automata Applications: distributed computing,
More informationToday: Amortized Analysis (examples) Multithreaded Algs.
Today: Amortized Analysis (examples) Multithreaded Algs. COSC 581, Algorithms March 11, 2014 Many of these slides are adapted from several online sources Reading Assignments Today s class: Chapter 17 (Amortized
More informationCharacterising Resource Management Performance in Kubernetes. Appendices.
Characterising Resource Management Performance in Kubernetes. Appendices. Víctor Medel a, Rafael Tolosana-Calasanz a, José Ángel Bañaresa, Unai Arronategui a, Omer Rana b a Aragon Institute of Engineering
More informationSOFTWARE ARCHITECTURES ARCHITECTURAL STYLES SCALING UP PERFORMANCE
SOFTWARE ARCHITECTURES ARCHITECTURAL STYLES SCALING UP PERFORMANCE Tomas Cerny, Software Engineering, FEE, CTU in Prague, 2014 1 ARCHITECTURES SW Architectures usually complex Often we reduce the abstraction
More informationPATH PLANNING FOR MULTIPLE ROBOTS. Pavel Surynek Charles University in Prague Faculty of Mathematics and Physics The Czech Republic
PATH PLANNING FOR MULTIPLE ROBOTS Charles University in Prague Faculty of Mathematics and Physics The Czech Republic PATH PLANNING FOR MULTIPLE ROBOTS Input: Graph G=(V,E) and a set of robots R={r 1,r
More information2. Introduction to Software for Embedded Systems
2. Introduction to Software for Embedded Systems Lothar Thiele ETH Zurich, Switzerland 2-1 Contents of Lectures (Lothar Thiele) 1. Introduction to Embedded System Design 2. Software for Embedded Systems
More informationMotivating Problem (2) Design for tree structures with whole-part hierarchies. The Composite Design Pattern
Motivating Problem (2) Design for tree structures with whole-part hierarchies. The Composite Design Pattern CABINET CHASSIS CHASSIS EECS3311 A: Software Design Fall 2018 POWER_SUPPLY CHEN-WEI WANG 3 of
More informationJava Garbage Collector Performance Measurements
WDS'09 Proceedings of Contributed Papers, Part I, 34 40, 2009. ISBN 978-80-7378-101-9 MATFYZPRESS Java Garbage Collector Performance Measurements P. Libič and P. Tůma Charles University, Faculty of Mathematics
More informationConcurrent Models of Computation for Embedded Software
Concurrent Models of Computation for Embedded Software Edward A. Lee Professor, UC Berkeley EECS 219D Concurrent Models of Computation Fall 2011 Copyright 2009-2011, Edward A. Lee, All rights reserved
More informationFormal Languages and Compilers Lecture VII Part 3: Syntactic A
Formal Languages and Compilers Lecture VII Part 3: Syntactic Analysis Free University of Bozen-Bolzano Faculty of Computer Science POS Building, Room: 2.03 artale@inf.unibz.it http://www.inf.unibz.it/
More informationJan 20, 2005 Lecture 2: Multiprogramming OS
Jan 20, 2005 Lecture 2: Multiprogramming OS February 17, 2005 1 Review OS mediates between hardware and user software QUIZ: Q: What is the most important function in an OS? A: To support multiprogramming
More informationVHDL framework for modeling fuzzy automata
Doru Todinca Daniel Butoianu Department of Computers Politehnica University of Timisoara SYNASC 2012 Outline Motivation 1 Motivation Why fuzzy automata? Why a framework for modeling FA? Why VHDL? 2 Fuzzy
More informationDynamic Logic David Harel, The Weizmann Institute Dexter Kozen, Cornell University Jerzy Tiuryn, University of Warsaw The MIT Press, Cambridge, Massac
Dynamic Logic David Harel, The Weizmann Institute Dexter Kozen, Cornell University Jerzy Tiuryn, University of Warsaw The MIT Press, Cambridge, Massachusetts, 2000 Among the many approaches to formal reasoning
More informationPetri Nets. Petri Nets. Petri Net Example. Systems are specified as a directed bipartite graph. The two kinds of nodes in the graph:
System Design&Methodologies Fö - 1 System Design&Methodologies Fö - 2 Petri Nets 1. Basic Petri Net Model 2. Properties and Analysis of Petri Nets 3. Extended Petri Net Models Petri Nets Systems are specified
More informationPath Optimization in Stream-Based Overlay Networks
Path Optimization in Stream-Based Overlay Networks Peter Pietzuch, prp@eecs.harvard.edu Jeff Shneidman, Jonathan Ledlie, Mema Roussopoulos, Margo Seltzer, Matt Welsh Systems Research Group Harvard University
More informationKnowledge Discovery and Data Mining. Neural Nets. A simple NN as a Mathematical Formula. Notes. Lecture 13 - Neural Nets. Tom Kelsey.
Knowledge Discovery and Data Mining Lecture 13 - Neural Nets Tom Kelsey School of Computer Science University of St Andrews http://tom.home.cs.st-andrews.ac.uk twk@st-andrews.ac.uk Tom Kelsey ID5059-13-NN
More informationCA441 BPM - Modelling Workflow with Petri Nets. Modelling Workflow with Petri Nets. Workflow Management Issues. Workflow. Process.
Modelling Workflow with Petri Nets 1 Workflow Management Issues Georgakopoulos,Hornick, Sheth Process Workflow specification Workflow Implementation =workflow application Business Process Modelling/ Workflow
More informationKnowledge Discovery and Data Mining
Knowledge Discovery and Data Mining Lecture 13 - Neural Nets Tom Kelsey School of Computer Science University of St Andrews http://tom.home.cs.st-andrews.ac.uk twk@st-andrews.ac.uk Tom Kelsey ID5059-13-NN
More informationSpecification and Testing of Banknote Processing Systems with Coloured Petri Nets
Specification and Testing of Banknote Processing Systems with Coloured Petri Nets Munich, 06/17/2010 30th TAV Agenda Automated testing in the software development process Motivation for system specifications
More informationModelling, Analysis and Scheduling with Dataflow Models
technische universiteit eindhoven Modelling, Analysis and Scheduling with Dataflow Models Marc Geilen, Bart Theelen, Twan Basten, Sander Stuijk, AmirHossein Ghamarian, Jeroen Voeten Eindhoven University
More informationComponent-based software development of multi-mode systems An extended report
Component-based software development of multi-mode systems An extended report Hang Yin Chalmers University of Technology, Gothenburg, Sweden yhang@chalmers.se Hans Hansson Mälardalen University, Västerås,
More informationStochastic Petri nets
Stochastic Petri nets 1 Stochastic Petri nets Markov Chain grows very fast with the dimension of the system Petri nets: High-level specification formalism Markovian Stochastic Petri nets adding temporal
More informationFighting CPS Complexity by Component-Based Software Development of Multi-Mode Systems
designs Article Fighting CPS Complexity by Component-Based Software Development of Multi-Mode Systems Hang Yin 1, * and Hans Hansson 2, 1 Zenuity, Lindholmspiren 2, 417 56 Gothenburg, Sweden 2 School of
More informationŁabiak G., Miczulski P. (IIE, UZ, Zielona Góra, Poland)
UML STATECHARTS AND PETRI NETS MODEL COMPARIS FOR SYSTEM LEVEL MODELLING Łabiak G., Miczulski P. (IIE, UZ, Zielona Góra, Poland) The system level modelling can be carried out with using some miscellaneous
More informationRNDr. Michal Kopecký, Ph.D. Department of Software Engineering, Faculty of Mathematics and Physics, Charles University in Prague
course: Database Applications (NDBI026) WS2015/16 RNDr. Michal Kopecký, Ph.D. Department of Software Engineering, Faculty of Mathematics and Physics, Charles University in Prague Transactions Transactional
More informationArchitectural Styles - Finale
Material and some slide content from: - Emerson Murphy-Hill - Software Architecture: Foundations, Theory, and Practice - Essential Software Architecture Architectural Styles - Finale Reid Holmes Lecture
More informationDistributed Relationship Schemes for Trees
Distributed Relationship Schemes for Trees Cyril Gavoille Arnaud Labourel University of Bordeaux, France December 17-21, 2007, Sendai Distributed bounded distance oracle Problem Assign a piece of information
More informationOnline Graph Exploration
Distributed Computing Online Graph Exploration Semester thesis Simon Hungerbühler simonhu@ethz.ch Distributed Computing Group Computer Engineering and Networks Laboratory ETH Zürich Supervisors: Sebastian
More informationRequirements Engineering process
Requirements Engineering process Used to discover, analyze, validate and manage requirements Varies depending on the application domain, the people involved and the organization developing the requirements
More informationDescribing Software Components with Parametric Contracts
Universität Karlsruhe (TH) Research University founded 1825 Describing Software Components with Parametric Contracts Ralf Reussner (reussner@ipd.uka.de) Chair Software Design and Quality Institute for
More informationRuntime Monitoring of Multi-Agent Manufacturing Systems for Deadlock Detection Based on Models
2009 21st IEEE International Conference on Tools with Artificial Intelligence Runtime Monitoring of Multi-Agent Manufacturing Systems for Deadlock Detection Based on Models Nariman Mani, Vahid Garousi,
More informationREPROTOOL Workflow (Textual documents in SW development) D3S Seminar
REPROTOOL Workflow (ual documents in SW development) D3S Seminar 2011-04-27 http://d3s.mff.cuni.cz Viliam Šimko simko@d3s.mff.cuni.cz CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics ual
More informationSequential Function Chart
Production Systems Control Automation Engineering 2011-2012 Sequential Function Chart Prof. Luca Ferrarini Eng. Giancarlo Mantovani Politecnico di Milano Dipartimento di Elettronica e Informazione Index
More informationCompiler Construction I
TECHNISCHE UNIVERSITÄT MÜNCHEN FAKULTÄT FÜR INFORMATIK Compiler Construction I Dr. Michael Petter SoSe 2015 1 / 58 Organizing Master or Bachelor in the 6th Semester with 5 ECTS Prerequisites Informatik
More informationJob Aid. View Functional Locations and Building Components
Table of Contents A. Parent Functional Location/AOID is known... 3 Details of all Functional Locations subordinate to a known parent (includes Building Components)... 3 B. Functional Locations linked to
More informationSymbolic Execution, Dynamic Analysis
Symbolic Execution, Dynamic Analysis http://d3s.mff.cuni.cz Pavel Parízek CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics Symbolic execution Pavel Parízek Symbolic Execution, Dynamic Analysis
More informationEECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization
EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Dataflow Lecture: SDF, Kahn Process Networks Stavros Tripakis University of California, Berkeley Stavros Tripakis: EECS
More informationJoint Entity Resolution
Joint Entity Resolution Steven Euijong Whang, Hector Garcia-Molina Computer Science Department, Stanford University 353 Serra Mall, Stanford, CA 94305, USA {swhang, hector}@cs.stanford.edu No Institute
More information3 SOLVING PROBLEMS BY SEARCHING
48 3 SOLVING PROBLEMS BY SEARCHING A goal-based agent aims at solving problems by performing actions that lead to desirable states Let us first consider the uninformed situation in which the agent is not
More informationFundamental Algorithms for System Modeling, Analysis, and Optimization
Fundamental Algorithms for System Modeling, Analysis, and Optimization Stavros Tripakis, Edward A. Lee UC Berkeley EECS 144/244 Fall 2014 Copyright 2014, E. A. Lee, J. Roydhowdhury, S. A. Seshia, S. Tripakis
More informationModeling Hybrid Systems with Petri Nets
Modeling Hybrid Systems with Petri Nets Debjyoti Bera, Kees van Hee and Henk Nijmeijer Abstract The behavior of a hybrid system is a mixture of continuous behavior and discrete event behavior. The Simulink/Stateflow
More informationFrom synchronous models to distributed, asynchronous architectures
From synchronous models to distributed, asynchronous architectures Stavros Tripakis Joint work with Claudio Pinello, Cadence Alberto Sangiovanni-Vincentelli, UC Berkeley Albert Benveniste, IRISA (France)
More informationLinear and Affine Transformations Coordinate Systems
Linear and Affine Transformations Coordinate Systems Recall A transformation T is linear if Recall A transformation T is linear if Every linear transformation can be represented as matrix Linear Transformation
More informationChapter 1 Introduction
Chapter 1 Introduction We hardly need to point out the importance of business process modelling and of respective automation in this place (see, e.g. [39, 45, 58, 110, 141]). Also the advantages and shortcomings
More informationTag a Tiny Aggregation Service for Ad-Hoc Sensor Networks. Samuel Madden, Michael Franklin, Joseph Hellerstein,Wei Hong UC Berkeley Usinex OSDI 02
Tag a Tiny Aggregation Service for Ad-Hoc Sensor Networks Samuel Madden, Michael Franklin, Joseph Hellerstein,Wei Hong UC Berkeley Usinex OSDI 02 Outline Introduction The Tiny AGgregation Approach Aggregate
More informationAn Introduction to Agent Based Modeling with Repast Michael North
An Introduction to Agent Based Modeling with Repast Michael North north@anl.gov www.cas.anl.gov Repast is an Agent-Based Modeling and Simulation (ABMS) Toolkit with a Focus on Social Simulation Our goal
More informationImproved BDD-based Discrete Analysis of Timed Systems
Improved BDD-based Discrete Analysis of Timed Systems Truong Khanh Nguyen 1, Jun Sun 2, Yang Liu 1, Jin Song Dong 1 and Yan Liu 1 1 School of Computing National University of Singapore 2 Information System
More informationASYMPTOTIC COMPLEXITY
Simplicity is a great virtue but it requires hard work to achieve it and education to appreciate it. And to make matters worse: complexity sells better. - Edsger Dijkstra ASYMPTOTIC COMPLEXITY Lecture
More informationAADL performance analysis with Cheddar : a review
AADL performance analysis with Cheddar : a review P. Dissaux*, J. Legrand*, A. Plantec+, F. Singhoff+ *Ellidiss Technologies, France +University of Brest/UBO, LISyC, France Talk overview 1. Cheddar project
More informationMaster of Science Thesis. Modeling deployment and allocation in the Progress IDE
Master of Science Thesis (D-level) Akademin för innovation, design och teknik David Šenkeřík Modeling deployment and allocation in the Progress IDE Mälardalen Research and Technology Centre Thesis supervisors:
More informationIn the following slides we will see some critical issues related to migration to BizTalk 2013.
In the following slides we will see some critical issues related to migration to BizTalk 2013. It is natural that, after evaluated all the benefits of a migration to a new version, the first question is:
More informationWEEK 5 - APPLICATION OF PETRI NETS. 4.4 Producers-consumers problem with priority
4.4 Producers-consumers problem with priority The net shown in Fig. 27 represents a producers-consumers system with priority, i.e., consumer A has priority over consumer B in the sense that A can consume
More informationPattern-Based Analysis of an Embedded Real-Time System Architecture
Pattern-Based Analysis of an Embedded Real-Time System Architecture Peter Feiler Software Engineering Institute phf@sei.cmu.edu 412-268-7790 Outline Introduction to SAE AADL Standard The case study Towards
More informationCIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
More informationPRG PROGRAMMING ESSENTIALS. Lecture 2 Program flow, Conditionals, Loops
PRG PROGRAMMING ESSENTIALS 1 Lecture 2 Program flow, Conditionals, Loops https://cw.fel.cvut.cz/wiki/courses/be5b33prg/start Michal Reinštein Czech Technical University in Prague, Faculty of Electrical
More information