Decidability of branching bisimulation on normed commutative context - PowerPoint PPT Presentation

Mar 20, 2024 •44 likes •1.16k views

Decidability of branching bisimulation on normed commutative context - free graphs W ojciech Czerwi ski Piotr Hofman S awomir Lasota University of W arsaw Problem Problem Given: infinite graph G, two vertices u, v Problem Given:

Negative semi - procedure • Search for a Spoiler’s winning strategy Spoiler • Di ffi culty: it has to be finite Duplicator • Strategy is winning: every path finite Spoiler • T ree is finitely - branching . . . . . . . .
Negative semi - procedure • Search for a Spoiler’s winning strategy Spoiler • Di ffi culty: it has to be finite Duplicator • Strategy is winning: every path finite Spoiler • T ree is finitely - branching . . . . . . . . • By König’s Lemma the tree is finite
Idea of the algorithm
Idea of the algorithm • Branching bisimilarity is essentially image finite
Idea of the algorithm • Branching bisimilarity is essentially image finite • It is enough to inspect only boundedly many possible Duplicator’s responses
Small response property
Small response property α β

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

On the Decidability of Normed BPA Yuxi Fu Bologna, 22-23 April, 2013 Infinite state systems have

On the Decidability of Normed BPA Yuxi Fu Bologna, 22-23 April, 2013 Infinite state systems have been studied in Process Rewriting Systems for some time. The focus has been on the decidability of reachability, equivalence, . . . . There are

931 views • 47 slides

Minimization of Large State Spaces using Symbolic Branching Bisimulation Ralf Wimmer (joint work

Minimization of Large State Spaces using Symbolic Branching Bisimulation Ralf Wimmer (joint work with Marc Herbstritt and Bernd Becker) Institute of Computer Science Albert-Ludwigs-University Freiburg Germany April 18th, 2006 Introduction

575 views • 19 slides

Theory of Computer Science D6. Decidability and Semi-Decidability Malte Helmert University of

Theory of Computer Science D6. Decidability and Semi-Decidability Malte Helmert University of Basel May 4, 2016 (Semi-) Decidability Recursive Enumerability Models of Computation and Semi-Decidability Summary Overview: Computability Theory

600 views • 39 slides

Theory of Computer Science May 4, 2016 D6. Decidability and Semi-Decidability Theory of

Theory of Computer Science May 4, 2016 D6. Decidability and Semi-Decidability Theory of Computer Science D6.1 (Semi-) Decidability D6. Decidability and Semi-Decidability D6.2 Recursive Enumerability Malte Helmert University of Basel D6.3

406 views • 7 slides

Computational Learning Theory 1 / 22 Decidability Computation Decidability which

Computational Learning Theory 1 / 22 Decidability Computation Decidability which problems have algorithmic solutions Machine Learning Feasibility what assumptions must we make to trust that we can learn an unknown target

246 views • 22 slides

A Brief Exploration of Normed Division Algebras From R to O (and beyond?) Riley Potts May 2020

A Brief Exploration of Normed Division Algebras From R to O (and beyond?) Riley Potts May 2020 What is a Normed Division Algebra? A Normed Division Algebra is a set, together with an additive operation and a multiplicative operation which

314 views • 17 slides

Probabilistic Applicative Bisimulation and Call-by-Value Lambda Calculi Joint work with Ugo Dal

Bisimulation Context Equivalence vs. Bisimulation Conclusions Probabilistic Applicative Bisimulation and Call-by-Value Lambda Calculi Joint work with Ugo Dal Lago Raphalle Crubill ENS Lyon February 9, 2014 Raphalle Crubill

875 views • 76 slides

Decidability Decidability p.1/27 Topics Discuss the power of algorithms

Decidability Decidability p.1/27 Topics Discuss the power of algorithms to solve problems Demonstrate that some problems can be solved by algorithms while other cannot Explore the limits of algorithmic solvability

477 views • 27 slides

Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus Matthias Mann

Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus Matthias Mann Johann Wolfgang Goethe-Universit at, Frankfurt, Germany Congruence of Bisimulation p. 1/21 Lambda Calculi and Equality Abramsky (90)

653 views • 21 slides

The Rigidity of Infinite Frameworks in Euclidean and Polyhedral Normed Spaces Sean Dewar

Motivation Preliminaries Rigidity in infinite frameworks Euclidean and polyhedral normed spaces Questions? The Rigidity of Infinite Frameworks in Euclidean and Polyhedral Normed Spaces Sean Dewar Lancaster University, Department of

616 views • 40 slides

Contents 1. Introduction 2. (Un)decidability on modal MTL logics Reducing to PCP The Global

Introduction (Un)decidability on modal MTL logics Undecidability of some modal MTL logics (formerly product logics) Amanda Vidal Institute of Computer Science, Czech Academy of Sciences September 6, 2016 1 / 19 Introduction (Un)decidability

705 views • 68 slides

Approximating Probabilistic Bisimulation by Introduction Background Conditional Expectation

Approximation by Averaging Panangaden Approximating Probabilistic Bisimulation by Introduction Background Conditional Expectation Cones and Duality Conditional expectation Prakash Panangaden Markov processes Bisimulation School of

1.29k views • 114 slides

Bisimulation and path logic for sheaves a 1 Sebastian Enqvist 2 Giovanni Cin 1 ILLC 2 ILLC and

Path logic and path bisimulation in concurrency Example: Bran L Path logic on sheaves Path bisimulation on sheaves Bisimulation and path logic for sheaves a 1 Sebastian Enqvist 2 Giovanni Cin 1 ILLC 2 ILLC and Lund University TACL 25/06/2015

816 views • 42 slides

Tecniche di Specifica e di Verifica Branching Time Temporal Logics I 1 Outline CTL ( C

Tecniche di Specifica e di Verifica Branching Time Temporal Logics I 1 Outline CTL ( C omputation T ree L ogic) Branching Time Unwindings --- computation trees Syntax and semantics of CTL. 2 Branching Time Structures

1.49k views • 112 slides

On the discrepancy between norms on tensor products of normed spaces Stanislaw Szarek Case

On the discrepancy between norms on tensor products of normed spaces Stanislaw Szarek Case Western Reserve U. & Sorbonne U. Collaborators: G. Aubrun, L. Lami, C. Palazuelos, A. Winter Arxiv: 1809.10616

414 views • 22 slides

From Applicative To Environmental Bisimulation Vasileios Koutavas

From Applicative To Environmental Bisimulation Vasileios Koutavas Trinity College Dublin Joint work with Paul B. Levy and Eijiro Sumii QMUL Program Equivalence

1.05k views • 66 slides

Logical laws for random graphs Maksim Zhukovskii Moscow Institute of Physics and Technology

Logical laws for random graphs Maksim Zhukovskii Moscow Institute of Physics and Technology IPMCCC April 18 2019 1 / 34 Examples A graph is... 2 / 34 Examples A graph is... triangle-free x 1 x 2 x 3 ( x 1 x

1.61k views • 104 slides

1 Principal Components Analysis 1. PC analysis is one of several statistical factor analysis

Announcement: Papers due on Wednesday. Next week set aside for presentations. You decide amongst yourselves how to split up the presentation duties (everyone should say something though). We will do the presentations on Zoom. Too many

321 views • 3 slides

Sets, Maps, Bit Sets Section 2.3 Dr. Mayfield and Dr. Lam Department of Computer Science James

Sets, Maps, Bit Sets Section 2.3 Dr. Mayfield and Dr. Lam Department of Computer Science James Madison University Oct 02, 2015 C/C++ pointers For those unfamiliar with pointers . . . int i; // integer int *p; // integer pointer p =

413 views • 15 slides

Programming up to Congruence Vilhelm Sj oberg and Stephanie Weirich University of Pennsylvania

Programming up to Congruence Vilhelm Sj oberg and Stephanie Weirich University of Pennsylvania October 14, 2013 WG 2.8 Aussois, France FP + dependent types What does this mean? Goal A functional programming language with an expressive

603 views • 33 slides

The Composition Method Wolfgang Thomas Francqui Lecture, Mons, April 2013 Mastering compositions

The Composition Method Wolfgang Thomas Francqui Lecture, Mons, April 2013 Mastering compositions Wolfgang Thomas Overview 1. Motivation 2. m -equivalence and the EF-game 3. Applications 4. m -types 5. Monadic types Wolfgang Thomas

1.06k views • 40 slides

Constraints, Graphs, Algebra, Logic, and complexity Moshe Y. Vardi Rice University Constraint

Constraints, Graphs, Algebra, Logic, and complexity Moshe Y. Vardi Rice University Constraint Satisfaction Problem (CSP) Input: ( V, D, C ) : A fi nite set V of variables A fi nite set D of values A fi nite set C of constraints

834 views • 38 slides

Exam Q&A I&E Basics/IBICT 2019 December 18th 2019 IBICT Attending 15 marks

Exam Q&A I&E Basics/IBICT 2019 December 18th 2019 IBICT Attending 15 marks Battle report (group essay of ~12 pages) Deliver by beginning of January 3 marks Battle class performance (+1 for winner) 15 marks

391 views • 9 slides

Counterterrorism/ Counterinsurgency Class 8 - August 27 How can governments stop insurgents or

Counterterrorism/ Counterinsurgency Class 8 - August 27 How can governments stop insurgents or terrorists? How can governments stop insurgents or terrorists? Use force Punitive military tactics Repression Police measures

564 views • 31 slides