Prof. Diletta Romana Cacciagrano. (red-cong) :

Slides:



Advertisements
Similar presentations
Model Checking Lecture 2. Three important decisions when choosing system properties: 1automata vs. logic 2branching vs. linear time 3safety vs. liveness.
Advertisements

Improper Integrals II. Improper Integrals II by Mika Seppälä Improper Integrals An integral is improper if either: the interval of integration is infinitely.
Process Algebra Book: Chapter 8. The Main Issue Q: When are two models equivalent? A: When they satisfy different properties. Q: Does this mean that the.
Tintu David Joy. Agenda Motivation Better Verification Through Symmetry-basic idea Structural Symmetry and Multiprocessor Systems Mur ϕ verification system.
GRAPHS, REACTIVE SYSTEMS AND MOBILE AMBIENTS Giacoma Valentina Monreale Supervisor: F. Gadducci.
Process Algebra (2IF45) Abstraction in Process Algebra Suzana Andova.
Game-theoretic simulation checking tool Peter Bulychev, Vladimir Zakharov, Igor Konnov Moscow State University.
Timed Automata.
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.
DATAFLOW PROCESS NETWORKS Edward A. Lee Thomas M. Parks.
Comp 205: Comparative Programming Languages Semantics of Imperative Programming Languages denotational semantics operational semantics logical semantics.
Spin Tutorial (some verification options). Assertion is always executable and has no other effect on the state of the system than to change the local.
Bisimulation Relation A lecture over E. Hagherdi, P. Tabuada, G. J. Pappas Bisimulation relation for dynamical, control, and hybrid systems Rafael Wisniewski.
Lecture 14 Go over midterm results Algorithms Efficiency More on prime numbers.
Semantics of LOTOS Answering the question: Which processes are equivalent? Basic LOTOS: ignore ! and ?...pure synchronization Dining philosophers example:
Simulation.
Chapter 16 Programming and Languages: Telling the Computer What to Do.
Specification Formalisms Book: Chapter 5. Properties of formalisms Formal. Unique interpretation. Intuitive. Simple to understand (visual). Succinct.
PSUCS322 HM 1 Languages and Compiler Design II Formal Semantics Material provided by Prof. Jingke Li Stolen with pride and modified by Herb Mayer PSU Spring.
Improper Integrals (9/24/08) There are two types of “improper integrals”: First Type: Definite integral taken over a ray or the whole real line, rather.
Canonical Prefixes of Petri Net Unfoldings Walter Vogler Universität Augsburg in cooperation with V. Khomenko, M. Koutny (CAV 2002, Acta Informatica 2003)
ESE601: Hybrid Systems Introduction to verification Spring 2006.
On the Correctness of Model Transformations Gabor Karsai ISIS/Vanderbilt University.
MTH-471 Integral Equations Sheikh Irfan Ullah Khan Assistant Professor Department of Mathematics COMSTAS Institute of Information Technology.
Compilers and Interpreters. Translation to machine language Every high level language needs to be translated to machine code There are different ways.
Programming Language Semantics Denotational Semantics Chapter 5 Part III Based on a lecture by Martin Abadi.
Abstract Verification is traditionally done by determining the truth of a temporal formula (the specification) with respect to a timed transition system.
Model Checking LTL over (discrete time) Controllable Linear System is Decidable P. Tabuada and G. J. Pappas Michael, Roozbeh Ph.D. Course November 2005.
PHY 042: Electricity and Magnetism
Monotone Sequences Objective: To define a Monotone Sequence and determine whether it converges or not.
Software Testing Sudipto Ghosh CS 406 Fall 99 November 9, 1999.
Testing Theory cont. Introduction Categories of Metrics Review of several OO metrics Format of Presentation CEN 5076 Class 6 – 10/10.
Process Algebra (2IF45) Probabilistic Branching Bisimulation: Exercises Dr. Suzana Andova.
Sequences Definition - A function whose domain is the set of all positive integers. Finite Sequence - finite number of values or elements Infinite Sequence.
Reactive systems – general
Ivan Lanese Computer Science Department University of Bologna/INRIA Italy Amending Choreographies Joint work with Fabrizio Montesi and Gianluigi Zavattaro.
1 Let X represent a Binomial r.v as in (3-42). Then from (2-30) Since the binomial coefficient grows quite rapidly with n, it is difficult to compute (4-1)
Lecture 81 Regional Automaton CS 5270 Lecture 8. Lecture 82 What We Need to Do Problem: –We need to analyze the timed behavior of a TTS. –The timed behavior.
1 Structuring Systems Requirements Use Case Description and Diagrams.
Further GroupBy & Extend Operations Objectives of the Lecture : To consider “whole relation” Grouping; To consider the SQL Grouping option Having; To consider.
Software Verification 2 Automated Verification Prof. Dr. Holger Schlingloff Institut für Informatik der Humboldt Universität and Fraunhofer Institut für.
MPRI 3 Dec 2007Catuscia Palamidessi 1 Why Probability and Nondeterminism? Concurrency Theory Nondeterminism –Scheduling within parallel composition –Unknown.
Lecture 5 1 CSP tools for verification of Sec Prot Overview of the lecture The Casper interface Refinement checking and FDR Model checking Theorem proving.
How to Program? -- Part 1 Part 1: Problem Solving –Analyze a problem –Decide what steps need to be taken to solve it. –Take into consideration any special.
2G1516 Formal Methods2005 Mads Dam IMIT, KTH 1 CCS: Processes and Equivalences Mads Dam Reading: Peled 8.5.
1 Logic Our ability to state invariants, record preconditions and post- conditions, and the ability to reason about a formal model depend on the logic.
Process Algebra (2IF45) Basic Process Algebra Dr. Suzana Andova.
4 - Conditional Control Structures CHAPTER 4. Introduction A Program is usually not limited to a linear sequence of instructions. In real life, a programme.
Model Checking Lecture 2. Model-Checking Problem I |= S System modelSystem property.
Wednesday, April 6MAT 146. Wednesday, April 6MAT 146.
Chapter 8: Concurrency Control on Relational Databases
Chapter 2 Section 3.
Prof. Dr. Holger Schlingloff 1,2 Dr. Esteban Pavese 1
Process Algebra (2IF45) Expressiveness of BPArec
Chapter 3 The Real Numbers.
SS 2018 Software Verification ML, state machines
Internet of Things A Process Calculus Approach
Software Verification 2 Automated Verification
Theory of Computation Turing Machines.
Clicker Question 1 What is the Simpson’s Rule estimate for the integral of f (x) = x2 + 1 on the interval [0, 4] using only two subdivisions? A. 12 2/3.
Formal Methods in software development
Clicker Question 1 What is the Simpson’s Rule estimate for the integral of f (x) = x2 + 1 on the interval [0, 4] using only two subdivisions? A. 12 2/3.
PROPOSITIONAL LOGIC - SYNTAX-
Introduction to verification
Determine whether the sequence converges or diverges. {image}
INDICES AND LOGARITHMS
The sum of an Infinite Series
A MODULAR LTS FOR OPEN REACTIVE SYSTEMS
Presentation transcript:

Prof. Diletta Romana Cacciagrano

(red-cong) :

α α CONG

α α

Early and late LTSs

L

L

L

Theorem:

Name instantation is moved inside the definition of bisimulation. The open bisimilarity, written, is the largest open bisimulation.

A set of processes to be test. A set of tests or observers. These are obtained by extending the syntax of processes to generate processes which can perform a particular action (omega) reporting success. A way to exercise a process on a given test: it is done by letting the process and the test to run in parallel and by looking at the computations which the embedded process can perform. These computations can be successful or failing, depending on whether or not they allow the execution of omega. A general criterion (semantics) for interpreting the results of these exercises.

Observer (Tests) Experiments

Bisimulation equivalences are usually rather strict: they depend on the whole branching structure of processes which, in some cases, are not relevant. Weak bisimulation incorporates a particular notion of fairness: it abstracts from the tau-loops (i.e infinite sequences of tau-moves): the “normal” behavior can be resumed each time after a finite sequence of tau-moves. Must testing semantics is based on the interpretation of tau-loops as divergences, making them quasi-observable as a chaotic or under- specified behavior. For this, it has been defined fair-testing semantics. The standard testing equivalences are coarser than weak bisimulation in the case of divergence-free processes, and they are incomparable in general.