ECE/CS 584: PVS Tutorial Part 1 Lecture 05 Sayan Mitra 1.

Slides:



Advertisements
Similar presentations
Model Checking Lecture 3. Specification Automata Syntax, given a set A of atomic observations: Sfinite set of states S 0 Sset of initial states S S transition.
Advertisements

Hybrid automata - Abstraction Anders P. Ravn Department of Computer Science, Aalborg University, Denmark Hybrid Systems – PhD School Aalborg University.
LING/C SC/PSYC 438/538 Computational Linguistics Sandiway Fong Lecture 13: 10/9.
Hybrid Systems Presented by: Arnab De Anand S. An Intuitive Introduction to Hybrid Systems Discrete program with an analog environment. What does it mean?
CS 290C: Formal Models for Web Software Lecture 4: Implementing and Verifying Statecharts Specifications Using the Spin Model Checker Instructor: Tevfik.
Timed Automata.
Introduction to Uppaal ITV Multiprogramming & Real-Time Systems Anders P. Ravn Aalborg University May 2009.
UPPAAL Andreas Hadiyono Arrummaisha Adrifina Harya Iswara Aditya Wibowo Juwita Utami Putri.
Pushdown Systems Koushik Sen EECS, UC Berkeley Slide Source: Sanjit A. Seshia.
1 Mechanical Verification of Timed Automata Myla Archer and Constance Heitmeyer Presented by Rasa Bonyadlou 24 October 2002.
HSCC 03 MIT LCS Safety Verification of Model Helicopter Controller Using Hybrid Input/Output Automata Sayan Mitra MIT Hybrid Systems: Computation and Control.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Digitaalsüsteemide verifitseerimise kursus1 Formal verification: Property checking Property checking.
Diagnosis of Discrete Event Systems Meir Kalech Partly based on slides of Gautam Biswass.
1 Stability of Hybrid Automata with Average Dwell Time: An Invariant Approach Daniel Liberzon Coordinated Science Laboratory University of Illinois at.
Multi-agent Planning Amin Atrash. Papers Dynamic Planning for Multiple Mobile Robots –Barry L. Brummit, Anthony Stentz OBDD-based Universal Planning:
Interface-based Design of Embedded Systems Thomas A. Henzinger University of California, Berkeley.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
An Introduction to Input/Output Automata Qihua Wang.
1 6. Constraint Automata Constraint Automaton – set of states, set of state variables, transitions between states, domain of state variables, and initial.
Conformance Simulation Relation ( ) Let and be two automata over the same alphabet simulates () if there exists a simulation relation such that Note that.
Lecture 3 Goals: Formal definition of NFA, acceptance of a string by an NFA, computation tree associated with a string. Algorithm to convert an NFA to.
Functional Design and Programming Lecture 10: Regular expressions and finite state machines.
1 An Inheritance-Based Technique for Building Simulation Proofs Incrementally Idit Keidar, Roger Khazan, Nancy Lynch, Alex Shvartsman MIT Lab for Computer.
Lecture 3 Goals: Formal definition of NFA, acceptance of a string by an NFA, computation tree associated with a string. Algorithm to convert an NFA to.
EECS 20 Lecture 2 (January 19, 2001) Tom Henzinger Mathematical Language.
Hybrid Systems a lecture over: Tom Henzinger’s The Theory of Hybrid Automata Anders P. Ravn Aalborg University PhD-reading course November 2005.
Towards a HOL Framework for the Deductive Analysis of Hybrid Control Systems ADPM’2000 Norbert Völker University of Essex, England.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
1 Pushdown Automata PDAs. 2 Pushdown Automaton -- PDA Input String Stack States.
Hybrid automata Rafael Wisniewski Automation and Control, Dept. of Electronic Systems Aalborg University, Denmark Hybrid Systems October 9th 2009.
Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1.
Spring semester 2006 ESE601: Hybrid Systems Review material on discrete event systems I.
Chapter 8 Asynchronous System Model by Mikhail Nesterenko “Distributed Algorithms” by Nancy A. Lynch.
ECE/CS 584: Hybrid Automaton Modeling Framework Executions, Reach set, Invariance Lecture 03 Sayan Mitra.
Presenter : Cheng-Ta Wu Vijay D’silva, S. Ramesh Indian Institute of Technology Bombay Arcot Sowmya University of New South Wales, Sydney.
1 IOA: Mathematical Models  Distributed Programs Nancy Lynch November 15, 2000 Collaborators: Steve Garland, Josh Tauber, Anna Chefter, Antonio Ramirez,
Lecture #5 Properties of hybrid systems João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Hybrid automata and temporal logics
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems Frits Vaandrager, University of Nijmegen joint work with Dilsun.
On Building PVS Interfaces for Abstraction Proofs Extending TAME for Refinements Sayan Mitra Myla Archer
1 Modeling and Analyzing Distributed Systems Using I/O Automata Nancy Lynch, MIT Draper Laboratory, IR&D Mid-Year Meeting December 11, 2002.
Hybrid Input/Output Automata: Theory and Applications
ECE/CS 584: Hybrid Automaton Modeling Framework Invariance, Abstractions, Simulation Lecture 04 Sayan Mitra.
1 IOA: Distributed Algorithms  Distributed Programs Nancy Lynch PODC 2000 Collaborators: Steve Garland, Josh Tauber, Anna Chefter, Antonio Ramirez, Michael.
Chapter 8 Asynchronous System Model by Mikhail Nesterenko “Distributed Algorithms” by Nancy A. Lynch.
Introduction to Recursion. Recursion Defined A procedure or function which calls itself. Powerful mechanism for repetition. Makes algorithms more compact.
ECE/CS 584: Verification of Embedded Computing Systems Model Checking Timed Automata Sayan Mitra Lecture 09.
Solving Systems by Elimination 5.4 NOTES, DATE ____________.
ECE/CS 584: Verification of Embedded Computing Systems Timed to Hybrid Automata Sayan Mitra (edited by Yu Wang) Lecture 10.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
1 Compositional Design and Analysis of Timing-Based Distributed Algorithms Nancy Lynch Theory of Distributed Systems MIT Third MURI Workshop Washington,
Lecture 11  2004 SDU Lecture7 Pushdown Automaton.
1 Modeling and Analyzing Distributed Systems Using I/O Automata Nancy Lynch, MIT Draper Laboratory, IR&D Kickoff Meeting Aug. 30, 2002.
UPPAAL Real-Time Systems Lab. Seolyoung, Jeong.
SS 2017 Software Verification Timed Automata
TIOA-to-UPPAAL Translator & Front-End Integration
Autonomous Cyber-Physical Systems: Synchronous Components: II
CSE322 The Chomsky Hierarchy
SS 2018 Software Verification ML, state machines
ECE/CS 584: Hybrid Automaton Modeling Framework Simulations and Composition Lecture 05 Sayan Mitra.
ECE/CS 584: Verification of Embedded Computing Systems
CSE322 Definition and description of finite Automata
Nondeterministic Finite Automata
Review material on discrete event systems I
State Machines EECS 20 Lecture 8 (February 2, 2001) Tom Henzinger.
Non Deterministic Automata
Mathematical Language
Naval Research Laboratory
Modeling and Analysis of Complex Computational Systems
Presentation transcript:

ECE/CS 584: PVS Tutorial Part 1 Lecture 05 Sayan Mitra 1

Plan for Today Substitutivity final comments PVS tutorial Part 1 2

Recap 3

Fun with compositions 4 automata, all have the same external actions a, b 4

automaton CatchUpA 5

automaton CatchUpB 6

7

automaton BoundedAlternateA external a, b states myturn : Bool := true, maxout : Nat transitions external b eff myturn := true external a pre myturn /\ ( maxout > 0) eff myturn := false ; maxout := maxout - 1 8

automaton BoundedAlternateB external a, b states myturn : Bool := false, maxout : Nat transitions external a eff myturn := true external b pre myturn /\ ( maxout > 0) eff myturn := false ; maxout := maxout - 1 9

Putting it all together 10

Wrap-up for Hybrid Automaton Modeling Framework Nondeterministic state machines Abstract transitions and trajectories Synchronization through shared actions – Shared variables (used Hybrid I/O automata) Executions, Reachability, Traces Forward backward simulations Substitutivity 11