Bisimulation Relation A lecture over E. Hagherdi, P. Tabuada, G. J. Pappas Bisimulation relation for dynamical, control, and hybrid systems Rafael Wisniewski.

Slides:



Advertisements
Similar presentations
Hybrid automata - Abstraction Anders P. Ravn Department of Computer Science, Aalborg University, Denmark Hybrid Systems – PhD School Aalborg University.
Advertisements

CSE 311 Foundations of Computing I
Process Algebra (2IF45) Abstraction in Process Algebra Suzana Andova.
Game-theoretic simulation checking tool Peter Bulychev, Vladimir Zakharov, Igor Konnov Moscow State University.
4/25/20151 Metodi formali nello sviluppo software a.a.2013/2014 Prof.Anna Labella.
Predicate Complete Testing * Thomas Ball * Thomas Ball, A Theory of Predicate-Complete Test Coverage and Generation, Technical Report MSR-TR ,
Behavioral Equivalence Hossein Hojjat Formal Lab University of Tehran.
Chaper 3 Weak Topologies. Reflexive Space.Separabe Space. Uniform Convex Spaces.
EECS 20 Lecture 38 (April 27, 2001) Tom Henzinger Review.
1 Introduction to Computability Theory Lecture2: Non Deterministic Finite Automata Prof. Amos Israeli.
Introduction to Computability Theory
EECS 20 Lecture 15 (February 21, 2001) Tom Henzinger Simulation.
Discrete Abstractions of Hybrid Systems Rajeev Alur, Thomas A. Henzinger, Gerardo Lafferriere and George J. Pappas.
EECS 20 Lecture 13 (February 14, 2001) Tom Henzinger Minimization.
Vector Spaces (10/27/04) The spaces R n which we have been studying are examples of mathematical objects which have addition and scalar multiplication.
EECS 20 Lecture 16 (February 26, 2001) Tom Henzinger Determinization.
07/06/98 知的インタフェース特論 1 Operational Semantics Again, the question? Operational Model = Labeled Transition System If P and Q yields a same LTS. How to define.
Model Checking Anders P. Ravn Department of Computer Science, Aalborg University, Denmark Hybrid Systems – PhD School Aalborg University January 2007.
Approximate Abstraction for Verification of Continuous and Hybrid Systems Antoine Girard Guest lecture ESE601: Hybrid Systems 03/22/2006
Abstract Some of the so called smallness conditions in algebra as well as in Category Theory, important and interesting for their own and also tightly.
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.
Hybrid Systems a lecture over: Tom Henzinger’s The Theory of Hybrid Automata Anders P. Ravn Aalborg University PhD-reading course November 2005.
ESE601: Hybrid Systems Introduction to verification Spring 2006.
An algebra of Connectors for modeling CommUnity with Tiles joint work with Roberto Bruni Ugo Montanari Dipartimento di Informatica Università di Pisa Ivan.
Hybrid automata Rafael Wisniewski Automation and Control, Dept. of Electronic Systems Aalborg University, Denmark Hybrid Systems October 9th 2009.
EECS 20 Chapter 3 Sections State Machines Continued Last time we Introduced the deterministic finite state machine Discussed the concept of state.
Abstract Verification is traditionally done by determining the truth of a temporal formula (the specification) with respect to a timed transition system.
EECS 20 Lecture 12 (February 12, 2001) Tom Henzinger Equivalence.
Model Checking LTL over (discrete time) Controllable Linear System is Decidable P. Tabuada and G. J. Pappas Michael, Roozbeh Ph.D. Course November 2005.
Winter 2012SEG Chapter 11 Chapter 1 (Part 2) Introduction to Requirements Modeling.
Approximation Metrics for Discrete and Continuous Systems Antoine Girard and George J. Pappas VERIMAG Workshop.
Category Theory By: Ashley Reynolds. HISTORY OF CATEGORY THEORY  In 1942–45, Samuel Eilenberg and Saunders Mac Lane introduced categories, functors,
A Decidable Recursive Logic for Weighted Transition Systems Bingtian Xue Aalborg University, DENMARK ICTAC, Sep 18, 2014 Joint work with Kim G. Larsen.
Process Algebra (2IF45) Probabilistic Branching Bisimulation: Exercises Dr. Suzana Andova.
Hybrid automata and temporal logics
1 Bisimulations as a Technique for State Space Reductions.
Prof. Diletta Romana Cacciagrano. (red-cong) :
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
Gauge Fields, Knots and Gravity Wayne Lawton Department of Mathematics National University of Singapore (65)
The homology groups of a partial monoid action category Ahmet A. Husainov
MA Day 53 – April 2, 2013 Section 13.2: Finish Line Integrals Begin 13.3: The fundamental theorem for line integrals.
Weak Bisimilarity Coalgebraically Andrei Popescu Department of Computer Science University of Illinois.
CSE 311 Foundations of Computing I Lecture 24 Finite State Machines Autumn 2012 CSE 3111.
2G1516 Formal Methods2005 Mads Dam IMIT, KTH 1 CCS: Processes and Equivalences Mads Dam Reading: Peled 8.5.
Math 3121 Abstract Algebra I Lecture 14 Sections
Process Algebra (2IF45) Analysing Probabilistic systems Dr. Suzana Andova.
The main study of Field Theory By: Valerie Toothman
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Department of Mathematics
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
Department of Mathematics
Prof. Dr. Holger Schlingloff 1,2 Dr. Esteban Pavese 1
Axioms for a category of spaces
Richard Anderson Lecture 29 NP-Completeness and course wrap-up
Chapter 3 The Real Numbers.
Automatically trivial fibrations
IDEALS AND I-SEQUENCES IN THE CATEGORY OF MODULES
Internet of Things A Process Calculus Approach
Alternating tree Automata and Parity games
Formal Methods in software development
Simulation based approach Shang Zechao
§1-3 Solution of a Dynamical Equation
Discrete Controller Synthesis
Chapter 3 The Real Numbers.
Introduction to Requirements Modeling
Formal Methods in software development
A new definition for the dynamics
Chapter 5 Limits and Continuity.
Introduction to verification
Presentation transcript:

Bisimulation Relation A lecture over E. Hagherdi, P. Tabuada, G. J. Pappas Bisimulation relation for dynamical, control, and hybrid systems Rafael Wisniewski Aalborg University Ph.D. course November 2005

Please ask as much as possible. I would be happy for all relevant to the topic questions.

Labeled Transition Systems

Product and Pullback Product of C 1 and C 2 Pullback

Product of Transition Systems

Strong Bisimulation Whenever commutes then commutes Open Maps:

Bran L Open Maps Bran L is a full subcategory of T L of all synchrinization trees with a single finite branch. P-bisimilarity:

Generalization of P-open maps We generalize P-open maps to the category Dyn of dynamical systems and Hyb the category of hybrid dynamical systems. The path category P as the full subcategory of Dyn with objects P : I → TI, where P(t) = (t, 1) and I is an open interval of R containing the origin. Morphism:

P-open Maps

P-bisimilarity for dynamical systems Pullback in the category of P-open surjective submersions:

Bisimilarity of Dynamical Systems

Example R Consider the vector field X on M = R 2 defined R Also consider the vector field Y on N = R defined by is a Dyn-morphism Then

Hybrid Dynamical Systems

Category Hyb Recall a time transition system from Henzinger The state space is Transition relation like in Henzinger

Path Category in Hyb The path category P is the full subcategory of Hyb: t0t0 t1t1 t2t2 t k-1 tktk dx/dt = 1

Example of a path Consider a path This path is represented by the path object P which has states l 0, l 1, l 2

P-open Maps for Hyb

Characterization of bisimulation in Hyb is said to be a bisimulation relation iff for all implies ▒▒

Bisimulation Characterization

Future Work Extension of the bisimulation notion from the article from timed transition systems to time abstract transition systems. This can be done by identify a whole flow line with a point in the space of flow lines. The strong simulation is too strong equivalence relation on dynamical systems is too strong. Try to use weaker equivalence relation some form of topological equivalency. On Friday 18th Nov. try to understand the definitions and go through proofs in the section dealing with the dynamical systems. If you understand P-open maps and bisimulation in the category of dynamical systems the generalization to hybrid systems seems natural.