The Montana Toolset: Formal Analysis of AADL Specifications
|
|
- Matilda Wade
- 6 years ago
- Views:
Transcription
1 Fremont Associates Process Project QA The Montana Toolset: Formal Analysis of AADL Specifications SAE AS-2 2 Working Group Seal Beach, California 27 January 2005
2 Outline Origins, Origins, Goals, Plans and Strategy ACSR ACSR and the VERSA Toolkit The The Charon Language and Toolkit The The Montana Toolkit STTR Phase I STTR Phase II
3 Origins STTR STTR AF04-T023 Modeling Languages and Analysis Tools for Complex Distributed Systems OBJECTIVE: Develop language and computational tool support for modeling and analyzing complex distributed system designs and integrate these methods to build distributed systems.
4 Origins AADL Language, Eclipse tools, OSATE, EMF ACSR: Algebra of Communicating Shared Resources Real-Time Resources VERSA tool support Charon Hybrid state machines Charon tool support
5 Goals, Plans and Strategy STTR Phase I Proof of Concept Translation; Annex Prototype Small case studies for demo STTR Phase II Primary R&D Tools Design and Development Methodology Proselytize Phase III Make the world a better place
6 Goals Plans and Strategy Phase Phase I Eclipse, Osate,, EMF Custom developed interface layer plug-ins C++ Implementation of VERSA Charon
7 Goals Plans and Strategy Phase Phase II Eclipse,? (AADL front-end), EMF Custom developed analysis plug-ins Fresh implementation of VERSA Interface to special purpose analysis engines CADP, CADP, Spin PVSPVS Books, tutorials, advocacy to support methodology
8 Outline Origins, Origins, Goals, Plans and Strategy ACSR ACSR and the VERSA Toolkit The The Charon Language and Toolkit The The Montana Toolkit STTR Phase I STTR Phase II
9 ACSR and the VERSA Toolkit ACSR: ACSR: Algebra of Communicating Shared Resources Process Algebra Real-time Timed Timed Actions Timeouts Interrupts Resources Priorities
10 ACSR and the VERSA Toolkit Events: (e,p).p( e,p).p,, ('e,p).p e,p).p,, (τ,p).p( Timed Actions: {(r1,p1),(r2,p2), }:P Choice: P1 + P2 Parallel Composition: P1 P2 Temporal Scope: P t a Miscellaneous operators ( P, P, P e t i )
11 ACSR and the VERSA Toolkit TBB = (in,1).tbb1; TBB1 = (in,1).tbb2 + (out,2).tbb; TBB2 = (out,2).tbb1; (in,1) TBB1 (in,1) TBB (out,2) (out,2) TBB2
12 ACSR and the VERSA Toolkit SYS = (OBBL OBBR)\{sync}; OBBL = (in,1).(sync,3).obbl; OBBR = ('sync,3).(out,2).obbr; OBBL (in,1) (sync,3) OBBL OBBR ( sync,3) (out,2) OBBR \sync
13 ACSR and the VERSA Toolkit OBBL (in,1) (sync,3) OBBL OBBR ( sync,3) (out,2) OBBR \sync (in,1) OBBL OBBR (out,2) (τ,6) OBBL OBBR (in,1) OBBL OBBR (out,2) OBBL OBBR
14 ACSR and the VERSA Toolkit {(r1,1),(r3,5)} {(r2,8),(r4,0)} {(r1,1),(r2,8),(r3,5),(r4,0)} {(r1,1),(r3,5)} (τ,1) (τ,1)
15 ACSR and the VERSA Toolkit {(r1,1),(r2,5)} {(r2,8),(r4,0)} X
16 ACSR and the VERSA Toolkit UtilityUtility State space exploration Equivalence testing VERSA: VERSA: Verification Execution and Rewrite System for ACSR Syntax checking State space construction State space exploration Equivalence testing Term rewriting
17 ACSR and the VERSA Toolkit UtilityUtility Traditional Schedulability Analysis Schedulability Analysis for Arbitrary Systems
18 Translating AADL to ACSR Threads Threads are modeled as ACSR processes Based on thread semantic automaton Processors and access connections are modeled as resources Event Event and data connections are modeled as communication channels
19 Example: Cruise Control Standard Standard example (from OSATE release) + auxiliary processes for bookkeeping
20 Example: Cruise Control Processor and connection bindings determine resources Scheduling protocol determines priorities Periodic processes have activators Scheduling_Protocol => EDF Dispatch_Protocol => periodic
21 ACSR and the VERSA Toolkit Eclipse + OSATE + EMF + Translator + VERSA + reinterpretation of results in AADL = Schedulability analysis for threads
22 Outline Origins, Origins, Goals, Plans and Strategy ACSR ACSR and the VERSA Toolkit The The Charon Language and Toolkit The The Montana Toolkit STTR Phase I STTR Phase II
23 Hybrid Automata: Formalism for Hybrid System Models Continuous dynamics: Mathematical equation Differential equation x = 1 (dx/dt = 1): : constant increase x = x (dx/dt = x): : exponential increase ( (x = e ) t Algebraic equation y = sin(x) Invariant x >= -10 Discrete control: Finite State Machine State: dynamics x = 1, x x = -1, x x = x,, x x = -x, Transition: switching of dynamics x = 1 > 10) > > x x = -1 (x > 10)
24 CHARON Language Features Individual components described as agents Composition, instantiation, and hiding Individual behaviors described as modes Encapsulation, instantiation, and scoping Support for concurrency Shared variables as well as message passing Support for discrete and continuous behavior Differential as well as algebraic constraints Discrete transitions can call Java routines
25 Syntax: Modes and Agents t=10 local t, rate {t = 1} global level, infusion { level [2,10] } Compute e dx x de t:=0 de level [4,8] dx level [2,10] Emergency level infusion global level global infusion {level = f(infusion)} Maintain {t<10} dx de Normal Agent Controller Agent Tank Modes describe sequential behavior Agents describe concurrency
26 Charon toolset: visual editor
27 Charon toolset: visual editor
28 Charon toolset: control panel
29 Charon toolset: simulation
30 Charon toolset: simulation
31 Case Study Four-legged Robot: Architectural Input touch sensors Output desired angles of each joint Components Brain: control four legs Four legs: control servo motors Model Instantiated from the same pattern
32 Case Study Four-legged Robot: Behavioral Model Control objective v = c High-level control laws x& = v x stride / 2 y & = kv L1 v j1 x y&= kv x& = kv x stride / 2 L2 j2 y (x, y) Low-level control laws j j 1 2 x = arctan( x / y) arccos( x = arccos( y + L 2L L L + y 2L 2 2 ) L x y L )
33 Code Generation Framework Front-end Translate CHARON objects into modular C++ objects Back-end Map C++ objects to execution environment CHARON objects agent front-end C++ objects class agent back-end Execution environment scheduler Target platform mode diff eqn transition analog var class mode diff() trans() class var API
34 Outline Origins, Origins, Goals, Plans and Strategy ACSR ACSR and the VERSA Toolkit The The Charon Language and Toolkit The The Montana Toolkit STTR Phase I STTR Phase II
35 The Montana Toolkit Phase I Translation of restricted model to ACSR Schedulability analysis of threads General state space exploration Simulation Definition of Charon behavioral annex Simulation Generation of code from AADL AADL architecture Embedded Charon
36 The Montana Toolkit Phase II Robust interpretation of AADL in ACSR Model checking Schedulability analysis Equivalence preserving system refactoring Equivalence testing Simulation Complete behavioral annex based on Charon Property checking Simulation Analysis
37 Outline Origins, Origins, Goals, Plans and Strategy ACSR ACSR and the VERSA Toolkit The The Charon Language and Toolkit The The Montana Toolkit STTR Phase I STTR Phase II
38 Contacts Duncan Clarke Oleg Sokolsky AFOSR STTR AF04-T023 Program Director: Dr. Robert L. Herklotz Program Manager: Software and Systems Air Force Office of Scientific Research 4015 Wilson Blvd., Room 713 Arlington, VA (703) fax (703)
The AADL behavior annex - experiments and roadmap
The AADL behavior annex - experiments and roadmap R. B. França 1 J-P. Bodeveix 1 M. Filali 1 J-F. Rolland 1 D. Chemouil 2 D. Thomas 3 1 Institut de Recherche en Informatique de Toulouse Université Paul
More informationSeamless Model Driven Development and Tool Support for Embedded Software-Intensive Systems
Seamless Model Driven Development and Tool Support for Embedded Software-Intensive Systems Computer Journal Lecture - 22nd June 2009 Manfred Broy Technische Universität München Institut für Informatik
More informationFormal Methods in Software Engineering
Formal Methods in Software Engineering Modeling Prof. Dr. Joel Greenyer October 21, 2014 Organizational Issues Tutorial dates: I will offer two tutorial dates Tuesdays 15:00-16:00 in A310 (before the lecture,
More informationA Timed CTL Model Checker for Real-Time Maude
A Timed CTL Model Checker for Real-Time Maude Daniela Lepri 1, Erika Ábrahám 2, and Peter Csaba Ölveczky 1 1 University of Oslo and 2 RWTH Aachen Real-Time Maude Extends Maude to real-time systems Object-oriented
More informationESE 601: Hybrid Systems. Instructor: Agung Julius Teaching assistant: Ali Ahmadzadeh
ESE 601: Hybrid Systems Instructor: Agung Julius Teaching assistant: Ali Ahmadzadeh Schedule Class schedule : Monday & Wednesday 1500 1630 Towne 305 Office hours : to be discussed (3 hrs/week) Emails:
More informationA Brief Introduction to Model Checking
A Brief Introduction to Model Checking Jan. 18, LIX Page 1 Model Checking A technique for verifying finite state concurrent systems; a benefit on this restriction: largely automatic; a problem to fight:
More informationLogic Model Checking
Logic Model Checking Lecture Notes 10:18 Caltech 101b.2 January-March 2004 Course Text: The Spin Model Checker: Primer and Reference Manual Addison-Wesley 2003, ISBN 0-321-22862-6, 608 pgs. the assignment
More informationFormal Verification of Mobile Network Protocols
Dipartimento di Informatica, Università di Pisa, Italy milazzo@di.unipi.it Pisa April 26, 2005 Introduction Modelling Systems Specifications Examples Algorithms Introduction Design validation ensuring
More informationEmbedded Systems 2. REVIEW: Actor models. A system is a function that accepts an input signal and yields an output signal.
Embedded Systems 2 REVIEW: Actor models A system is a function that accepts an input signal and yields an output signal. The domain and range of the system function are sets of signals, which themselves
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationAn Introduction to Hybrid Systems Modeling
CS620, IIT BOMBAY An Introduction to Hybrid Systems Modeling Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS620: New Trends in IT: Modeling and Verification of Cyber-Physical
More informationECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University
ECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University Prof. Mi Lu TA: Ehsan Rohani Laboratory Exercise #4 MIPS Assembly and Simulation
More informationBusiness Process Management
Business Process Management Theory: The Pi-Calculus Frank Puhlmann Business Process Technology Group Hasso Plattner Institut Potsdam, Germany 1 What happens here? We discuss the application of a general
More informationAbstractions and Decision Procedures for Effective Software Model Checking
Abstractions and Decision Procedures for Effective Software Model Checking Prof. Natasha Sharygina The University of Lugano, Carnegie Mellon University Microsoft Summer School, Moscow, July 2011 Lecture
More informationSafety-Critical Medical Device Development Using the UPP2SF Model
University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science 2014 Safety-Critical Medical Device Development Using the UPP2SF Model Miroslav Pajic
More informationModel Checking. Boris Feigin March 9, University College London
b.feigin@cs.ucl.ac.uk University College London March 9, 2005 Outline 1 2 Techniques Symbolic 3 Software 4 Vs. Deductive Verification Summary Further Reading In a nutshell... Model checking is a collection
More informationOutline F eria AADL behavior 1/ 78
Outline AADL behavior Annex Jean-Paul Bodeveix 2 Pierre Dissaux 3 Mamoun Filali 2 Pierre Gaufillet 1 François Vernadat 2 1 AIRBUS-FRANCE 2 FéRIA 3 ELLIDIS SAE AS2C Detroit Michigan April 2006 FéRIA AADL
More informationThe Discrete EVent System specification (DEVS) formalism
The Discrete EVent System specification (DEVS) formalism Hans Vangheluwe The DEVS formalism was conceived by Zeigler [Zei84a, Zei84b] to provide a rigourous common basis for discrete-event modelling and
More informationAlgebraic Trace Theory
Algebraic Trace Theory EE249 Roberto Passerone Material from: Jerry R. Burch, Trace Theory for Automatic Verification of Real-Time Concurrent Systems, PhD thesis, CMU, August 1992 October 21, 2002 ee249
More informationAn Automotive Case Study ERTSS 2016
Institut Mines-Telecom Virtual Yet Precise Prototyping: An Automotive Case Study Paris Sorbonne University Daniela Genius, Ludovic Apvrille daniela.genius@lip6.fr ludovic.apvrille@telecom-paristech.fr
More informationStochastic, Hybrid and Real-Time Systems: From Foundations To Applications with Modest
LCCC WORKSHOP 2013, LUND Stochastic, Hybrid and Real-Time Systems: From Foundations To Applications with Modest, Arnd Hartmanns Saarland University, Germany based on joint work with Jonathan Bogdoll, Henrik
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationAlgebraic Trace Theory
Algebraic Trace Theory EE249 Presented by Roberto Passerone Material from: Jerry R. Burch, Trace Theory for Automatic Verification of Real-Time Concurrent Systems, PhD thesis, CMU, August 1992 October
More informationAndrew Morton University of Waterloo Canada
EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo Canada Outline 1) Introduction and motivation 2) Review of EDF and feasibility analysis 3) Hardware accelerators and scheduling
More informationEMBEDDED SYSTEMS WILLIAM C. ROUNDS AND HOSUNG SONG
THE φ-calculus A HYBRID EXTENSION OF THE π-calculus TO EMBEDDED SYSTEMS WILLIAM C. ROUNDS AND HOSUNG SONG 1. Introduction Embedded systems are software systems which reside in a physical environment and
More informationEmbedded Systems 5. Synchronous Composition. Lee/Seshia Section 6.2
Embedded Systems 5-1 - Synchronous Composition Lee/Seshia Section 6.2 Important semantic model for concurrent composition Here: composition of actors Foundation of Statecharts, Simulink, synchronous programming
More informationLecture 4. Applications
Lecture 4. Applications Summary Tools such as HyTech, CheckMate, Uppaal, Kronos have been used in many contexts typically to verify safety of a control design or to get tight bounds on parameters (e.g.
More informationAn introduction to Uppaal and Timed Automata MVP5 1
An introduction to Uppaal and Timed Automata MVP5 1 What is Uppaal? (http://www.uppaal.com/) A simple graphical interface for drawing extended finite state machines (automatons + shared variables A graphical
More informationUsing Timed Input/Output Automata for Implementing Distributed Systems
Using Timed Input/Output Automata for Implementing Distributed Systems Peter M. Musial CSAIL, MIT, MA, USA pmmusial@csail.mit.edu Abstract The objective of this work is the derivation of software that
More informationMulticore Semantics and Programming
Multicore Semantics and Programming Peter Sewell Tim Harris University of Cambridge Oracle October November, 2015 p. 1 These Lectures Part 1: Multicore Semantics: the concurrency of multiprocessors and
More informationTimo Latvala. March 7, 2004
Reactive Systems: Safety, Liveness, and Fairness Timo Latvala March 7, 2004 Reactive Systems: Safety, Liveness, and Fairness 14-1 Safety Safety properties are a very useful subclass of specifications.
More informationThe Underlying Semantics of Transition Systems
The Underlying Semantics of Transition Systems J. M. Crawford D. M. Goldschlag Technical Report 17 December 1987 Computational Logic Inc. 1717 W. 6th St. Suite 290 Austin, Texas 78703 (512) 322-9951 1
More information7. Queueing Systems. 8. Petri nets vs. State Automata
Petri Nets 1. Finite State Automata 2. Petri net notation and definition (no dynamics) 3. Introducing State: Petri net marking 4. Petri net dynamics 5. Capacity Constrained Petri nets 6. Petri net models
More informationA Compositional Approach to Bisimulation of Arenas of Finite State Machines
A Compositional Approach to Bisimulation of Arenas of Finite State Machines Giordano Pola, Maria D. Di Benedetto and Elena De Santis Department of Electrical and Information Engineering, Center of Excellence
More informationPartial model checking via abstract interpretation
Partial model checking via abstract interpretation N. De Francesco, G. Lettieri, L. Martini, G. Vaglini Università di Pisa, Dipartimento di Ingegneria dell Informazione, sez. Informatica, Via Diotisalvi
More informationModelling Real-Time Systems. Henrik Ejersbo Jensen Aalborg University
Modelling Real-Time Systems Henrik Ejersbo Jensen Aalborg University Hybrid & Real Time Systems Control Theory Plant Continuous sensors actuators Task TaskTask Controller Program Discrete Computer Science
More informationGenerating Linear Temporal Logic Formulas for Pattern-Based Specifications
Generating Linear Temporal Logic Formulas for Pattern-Based Specifications Salamah Salamah, Vladik Kreinovich, and Ann Q. Gates Dept. of Computer Science, University of Texas at El Paso El Paso, TX 79968,
More informationTimed Automata VINO 2011
Timed Automata VINO 2011 VeriDis Group - LORIA July 18, 2011 Content 1 Introduction 2 Timed Automata 3 Networks of timed automata Motivation Formalism for modeling and verification of real-time systems.
More informationReal-Time Software Transactional Memory: Contention Managers, Time Bounds, and Implementations
Real-Time Software Transactional Memory: Contention Managers, Time Bounds, and Implementations Mohammed El-Shambakey Dissertation Submitted to the Faculty of the Virginia Polytechnic Institute and State
More informationSoftware Verification
Software Verification Grégoire Sutre LaBRI, University of Bordeaux, CNRS, France Summer School on Verification Technology, Systems & Applications September 2008 Grégoire Sutre Software Verification VTSA
More informationSpecial Nodes for Interface
fi fi Special Nodes for Interface SW on processors Chip-level HW Board-level HW fi fi C code VHDL VHDL code retargetable compilation high-level synthesis SW costs HW costs partitioning (solve ILP) cluster
More informationSupporting Intra-Task Parallelism in Real- Time Multiprocessor Systems José Fonseca
Technical Report Supporting Intra-Task Parallelism in Real- Time Multiprocessor Systems José Fonseca CISTER-TR-121007 Version: Date: 1/1/2014 Technical Report CISTER-TR-121007 Supporting Intra-Task Parallelism
More informationBounded Retransmission in Event-B CSP: a Case Study
Available online at www.sciencedirect.com Electronic Notes in Theoretical Computer Science 280 (2011) 69 80 www.elsevier.com/locate/entcs Bounded Retransmission in Event-B CSP: a Case Study Steve Schneider
More informationOn simulations and bisimulations of general flow systems
On simulations and bisimulations of general flow systems Jen Davoren Department of Electrical & Electronic Engineering The University of Melbourne, AUSTRALIA and Paulo Tabuada Department of Electrical
More informationVerification of Hybrid Systems with Ariadne
Verification of Hybrid Systems with Ariadne Davide Bresolin 1 Luca Geretti 2 Tiziano Villa 3 1 University of Bologna 2 University of Udine 3 University of Verona An open workshop on Formal Methods for
More informationFrom CCS to Hybrid π via baby steps. Bill Rounds CSE, U of Michigan
From CCS to Hybrid π via baby steps Bill Rounds CSE, U of Michigan Main idea The hybrid pi-calculus extends pi-calculus by adding a component called the continuous environment, which evolves over time
More informationFormal Verification. Lecture 1: Introduction to Model Checking and Temporal Logic¹
Formal Verification Lecture 1: Introduction to Model Checking and Temporal Logic¹ Jacques Fleuriot jdf@inf.ed.ac.uk ¹Acknowledgement: Adapted from original material by Paul Jackson, including some additions
More informationCompiling Techniques
Lecture 11: Introduction to 13 November 2015 Table of contents 1 Introduction Overview The Backend The Big Picture 2 Code Shape Overview Introduction Overview The Backend The Big Picture Source code FrontEnd
More informationVarieties of Stochastic Calculi
Research is what I'm doing when I don't know what I'm doing. Wernher Von Braun. Artificial Biochemistry Varieties of Stochastic Calculi Microsoft Research Trento, 26-5-22..26 www.luca.demon.co.uk/artificialbiochemistry.htm
More informationA GENERIC FORMAL SPECIFICATION OF FU- SION OF MODALITIES IN A MULTIMODAL HCI
A GENERIC FORMAL SPECIFICATION OF FU- SION OF MODALITIES IN A MULTIMODAL HCI Yamine AIT AMEUR 1 and Nadjet KAMEL 1,2 LISI/ENSMA-Université de Poitiers 1 LRIA-USTHB 2 Site du Futuroscope. 86960 Futuroscope
More informationNCS Lecture 11 Distributed Computation for Cooperative Control. Richard M. Murray (Caltech) and Erik Klavins (U. Washington) 17 March 2008
NCS Lecture 11 Distributed Computation for Cooperative Control Richard M. Murray (Caltech) and Erik Klavins (U. Washington) 17 March 2008 Goals: Describe methods for modeling and analyzing distributed
More informationDistributed Semantics and Implementation for Systems with Interaction and Priority
Distributed Semantics and Implementation for Systems with Interaction and Priority Ananda Basu, Philippe Bidinger, Marius Bozga, and Joseph Sifakis Université Grenoble 1 - CNRS - VERIMAG Centre Équation,
More informationMeta-reasoning in the concurrent logical framework CLF
Meta-reasoning in the concurrent logical framework CLF Jorge Luis Sacchini (joint work with Iliano Cervesato) Carnegie Mellon University Qatar campus Nagoya University, 27 June 2014 Jorge Luis Sacchini
More informationOne Year Later. Iliano Cervesato. ITT Industries, NRL Washington, DC. MSR 3.0:
MSR 3.0: The Logical Meeting Point of Multiset Rewriting and Process Algebra MSR 3: Iliano Cervesato iliano@itd.nrl.navy.mil One Year Later ITT Industries, inc @ NRL Washington, DC http://www.cs.stanford.edu/~iliano
More informationAgent-Based HOL Reasoning 1
Agent-Based HOL Reasoning 1 Alexander Steen Max Wisniewski Christoph Benzmüller Freie Universität Berlin 5th International Congress on Mathematical Software (ICMS 2016) 1 This work has been supported by
More informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
More informationTrace Refinement of π-calculus Processes
Trace Refinement of pi-calculus Processes Trace Refinement of π-calculus Processes Manuel Gieseking manuel.gieseking@informatik.uni-oldenburg.de) Correct System Design, Carl von Ossietzky University of
More informationModal and Temporal Logics
Modal and Temporal Logics Colin Stirling School of Informatics University of Edinburgh July 23, 2003 Why modal and temporal logics? 1 Computational System Modal and temporal logics Operational semantics
More informationSemantic Equivalences and the. Verification of Infinite-State Systems 1 c 2004 Richard Mayr
Semantic Equivalences and the Verification of Infinite-State Systems Richard Mayr Department of Computer Science Albert-Ludwigs-University Freiburg Germany Verification of Infinite-State Systems 1 c 2004
More informationVerifying Temporal Properties of Reactive Systems: A STeP Tutorial *
Formal Methods in System Design, 16, 1 45 (2000) c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Verifying Temporal Properties of Reactive Systems: A STeP Tutorial * NIKOLAJ
More informationTemporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.
EE 244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Temporal logic Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 244, Fall 2016
More informationMethods for Software Verification. Andrea Corradini Gian Luigi Ferrari. Second Semester 6 CFU
Methods for Software Verification Andrea Corradini Gian Luigi Ferrari Second Semester 6 CFU. The importance of Software Correctness Increasing integration of ICT in different applications: Embedded systems
More informationMultiprocessor Scheduling of Age Constraint Processes
Multiprocessor Scheduling of Age Constraint Processes Lars Lundberg Department of Computer Science, University of Karlskrona/Ronneby, Soft Center, S-372 25 Ronneby, Sweden, email: Lars.Lundberg@ide.hk-r.se
More informationIntroduction to mcrl2
Introduction to mcrl2 Luís S. Barbosa DI-CCTC Universidade do Minho Braga, Portugal May, 2011 mcrl2: A toolset for process algebra mcrl2 provides: a generic process algebra, based on Acp (Bergstra & Klop,
More informationA Reconfigurable Quantum Computer
A Reconfigurable Quantum Computer David Moehring CEO, IonQ, Inc. College Park, MD Quantum Computing for Business 4-6 December 2017, Mountain View, CA IonQ Highlights Full Stack Quantum Computing Company
More informationTHEORY OF SYSTEMS MODELING AND ANALYSIS. Henny Sipma Stanford University. Master class Washington University at St Louis November 16, 2006
THEORY OF SYSTEMS MODELING AND ANALYSIS Henny Sipma Stanford University Master class Washington University at St Louis November 16, 2006 1 1 COURSE OUTLINE 8:37-10:00 Introduction -- Computational model
More informationModel-based engineering of embedded systems using the hybrid process algebra Chi
LIX Colloquium 2006 Model-based engineering of embedded systems using the hybrid process algebra Chi J.C.M. Baeten, D.A. van Beek, P.J.L. Cuijpers, M.A. Reniers J.E. Rooda, R.R.H. Schiffelers, R.J.M. Theunissen
More informationTime and Schedulability Analysis of Stateflow Models
Time and Schedulability Analysis of Stateflow Models Marco Di Natale Scuola Superiore S. Anna Haibo Zeng Mc Gill University Outline Context: MBD of Embedded Systems Relationship with PBD An Introduction
More informationTTA and PALS: Formally Verified Design Patterns for Distributed Cyber-Physical
TTA and PALS: Formally Verified Design Patterns for Distributed Cyber-Physical DASC 2011, Oct/19 CoMMiCS Wilfried Steiner wilfried.steiner@tttech.com TTTech Computertechnik AG John Rushby rushby@csl.sri.com
More informationRecent results on Timed Systems
Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.
More informationQuantum computing with superconducting qubits Towards useful applications
Quantum computing with superconducting qubits Towards useful applications Stefan Filipp IBM Research Zurich Switzerland Forum Teratec 2018 June 20, 2018 Palaiseau, France Why Quantum Computing? Why now?
More informationEmbedded Systems Development
Embedded Systems Development Lecture 2 Finite Automata & SyncCharts Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Some things I forgot to mention 2 Remember the HISPOS registration
More informationMarwan Burelle. Parallel and Concurrent Programming. Introduction and Foundation
and and marwan.burelle@lse.epita.fr http://wiki-prog.kh405.net Outline 1 2 and 3 and Evolutions and Next evolutions in processor tends more on more on growing of cores number GPU and similar extensions
More informationProcess Algebras and Concurrent Systems
Process Algebras and Concurrent Systems Rocco De Nicola Dipartimento di Sistemi ed Informatica Università di Firenze Process Algebras and Concurrent Systems August 2006 R. De Nicola (DSI-UNIFI) Process
More informationOperational Semantics
Operational Semantics Semantics and applications to verification Xavier Rival École Normale Supérieure Xavier Rival Operational Semantics 1 / 50 Program of this first lecture Operational semantics Mathematical
More informationIntroduction to process algebra
Introduction to process algebra Luís S. Barbosa DI-CCTC Universidade do Minho Braga, Portugal March, 2010 Actions & processes Action is a latency for interaction for a L, L denoting a set of names Act
More informationScalable and Accurate Verification of Data Flow Systems. Cesare Tinelli The University of Iowa
Scalable and Accurate Verification of Data Flow Systems Cesare Tinelli The University of Iowa Overview AFOSR Supported Research Collaborations NYU (project partner) Chalmers University (research collaborator)
More informationFormal Analysis of UML/OCL Models
Formal Analysis of UML/OCL Models Achim D. Brucker Vincenz-Priessnitz-Str. 1, 76131 Karlsruhe, Germany achim.brucker@sap.com University Bremen Computer Science Colloqium Bremen, 29th October 2008 Outline
More informationHybrid Systems Modeling, Analysis and Control
Hybrid Systems Modeling, Analysis and Control Radu Grosu Vienna University of Technology Lecture 6 Continuous AND Discrete Systems Control Theory Continuous systems approximation, stability control, robustness
More informationHeterogenous Parallel Computing with Ada Tasking
Heterogenous Parallel Computing with Ada Tasking Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu
More informationA Formal Model of Clock Domain Crossing and Automated Verification of Time-Triggered Hardware
A Formal Model of Clock Domain Crossing and Automated Verification of Time-Triggered Hardware Julien Schmaltz Institute for Computing and Information Sciences Radboud University Nijmegen The Netherlands
More informationUML modeling for INF5150
UML modeling for INF5150 Version 101022 ICU 0-1 22-Oct-10 INF5150 Unassailable IT-systems 1 Disciplined Heterogeneous Modeling Edward A. Lee Robert S. Pepper Distinguished Professor EECS Department UC
More informationAutomata-theoretic analysis of hybrid systems
Automata-theoretic analysis of hybrid systems Madhavan Mukund SPIC Mathematical Institute 92, G N Chetty Road Chennai 600 017, India Email: madhavan@smi.ernet.in URL: http://www.smi.ernet.in/~madhavan
More informationChapter 1 Introduction
Chapter 1 Introduction 1.1 Introduction to Chapter This chapter starts by describing the problems addressed by the project. The aims and objectives of the research are outlined and novel ideas discovered
More informationDefining and validating the behavior of component interfaces in navigation software
Eindhoven University of Technology MASTER Defining and validating the behavior of component interfaces in navigation software Josquin, G.J. Award date: 2014 Link to publication Disclaimer This document
More informationEE291E Lecture Notes 3 Autonomous Hybrid Automata
EE9E Lecture Notes 3 Autonomous Hybrid Automata Claire J. Tomlin January, 8 The lecture notes for this course are based on the first draft of a research monograph: Hybrid Systems. The monograph is copyright
More informationDesign of Distributed Systems Melinda Tóth, Zoltán Horváth
Design of Distributed Systems Melinda Tóth, Zoltán Horváth Design of Distributed Systems Melinda Tóth, Zoltán Horváth Publication date 2014 Copyright 2014 Melinda Tóth, Zoltán Horváth Supported by TÁMOP-412A/1-11/1-2011-0052
More informationCo-simulation of embedded systems: a PVS-Simulink integrated environment
Co-simulation of embedded systems: a PVS-Simulink integrated environment Cinzia Bernardeschi 1 Andrea Domenici 1 Paolo Masci 2 1 Department of Information Engineering, University of Pisa 2 INESC-TEC and
More informationOverview. 1 Lecture 1: Introduction. 2 Lecture 2: Message Sequence Charts. Joost-Pieter Katoen Theoretical Foundations of the UML 1/32
Overview 1 Lecture 1: Introduction 2 Lecture 2: Message Sequence Charts Joost-Pieter Katoen Theoretical Foundations of the UML 1/32 Theoretical Foundations of the UML Lecture 1: Introduction Joost-Pieter
More informationTechnical report bds:00-21
Delft University of Technology Fac. of Information Technology and Systems Control Systems Engineering Technical report bds:00-21 Stability Analysis of Discrete Event Systems (by K.M. Passino and K.L. Burgess,
More informationClasses and conversions
Classes and conversions Regular expressions Syntax: r = ε a r r r + r r Semantics: The language L r of a regular expression r is inductively defined as follows: L =, L ε = {ε}, L a = a L r r = L r L r
More informationComputability and Complexity
Computability and Complexity Sequences and Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability
More informationObject Modeling Approach! Object Modeling Approach!
Object Modeling Approach! 1 Object Modeling Approach! Start with a problem statement! High-level requirements! Define object model! Identify objects and classes! Prepare data dictionary! Identify associations
More informationA framework for simulation and symbolic state space analysis of non-markovian models
A framework for simulation and symbolic state space analysis of non-markovian models Laura Carnevali, Lorenzo Ridi, Enrico Vicario SW Technologies Lab (STLab) - Dip. Sistemi e Informatica (DSI) - Univ.
More informationThe Algebra of Connectors Structuring Interaction in BIP
1 The Algebra of Connectors Structuring Interaction in BIP Simon Bliudze, Joseph Sifakis Abstract We provide an algebraic formalization of connectors in the BIP component framework. A connector relates
More informationVerification of Polynomial Interrupt Timed Automata
Verification of Polynomial Interrupt Timed Automata Béatrice Bérard 1, Serge Haddad 2, Claudine Picaronny 2, Mohab Safey El Din 1, Mathieu Sassolas 3 1 Université P. & M. Curie, LIP6 2 ENS Cachan, LSV
More informationDecomposition of planning for multi-agent systems under LTL specifications
Decomposition of planning for multi-agent systems under LTL specifications Jana Tumova and Dimos V. Dimarogonas KTH Royal Institute of Technology R E C O N F I G December 14, 2015 General Motivation and
More informationAbstracting real-valued parameters in parameterised boolean equation systems
Department of Mathematics and Computer Science Formal System Analysis Research Group Abstracting real-valued parameters in parameterised boolean equation systems Master Thesis M. Laveaux Supervisor: dr.
More informationPlasma: A new SMC Checker. Axel Legay. In collaboration with L. Traonouez and S. Sedwards.
Plasma: A new SMC Checker Axel Legay In collaboration with L. Traonouez and S. Sedwards. 1 Plasma Lab A PLAtform for Statistical Model Analysis A library of statistical model-checking algorithms (Monte-Carlo,
More informationComplex Systems Design & Distributed Calculus and Coordination
Complex Systems Design & Distributed Calculus and Coordination Concurrency and Process Algebras: Theory and Practice Francesco Tiezzi University of Camerino francesco.tiezzi@unicam.it A.A. 2014/2015 F.
More information