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

Mar 20, 2024 •44 likes •1.17k 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 α β

Recommend

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

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

315 views • 17 slides

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

933 views • 47 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

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

823 views • 42 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

878 views • 76 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

622 views • 40 slides

Branching for PDEs Xavier Warin CEMRACS July Xavier Warin Branching for PDEs

Branching for PDEs Xavier Warin CEMRACS July Xavier Warin Branching for PDEs CEMRACS July 1 / 94 The StOpt Library Table of contents 1 The StOpt Library 2 Branching for KPP equations 3 Generalization of KPP

1.2k views • 96 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

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

481 views • 27 slides

Lecture 3: Decidability January 11, 2011 Lecture 3, Slide 1 ECS 235B, Foundations of Information

Outline Review Decidability of security Take-Grant Protection Model Lecture 3: Decidability January 11, 2011 Lecture 3, Slide 1 ECS 235B, Foundations of Information and Computer Security January 11, 2011 Outline Review Decidability of

788 views • 57 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

250 views • 22 slides

Decidability Decidability and Symbolic Symbolic Verification Symbolic Symbolic Verification

Decidability Decidability and Symbolic Symbolic Verification Symbolic Symbolic Verification Verification Verification Kim G. Larsen Kim G. Larsen Aalborg Aalborg University Aalborg Aalborg University University DENMARK University, ,

685 views • 46 slides

Theory of Computer Science C4. Regular Languages: Closure Properties and Decidability Malte

Theory of Computer Science C4. Regular Languages: Closure Properties and Decidability Malte Helmert University of Basel April 4, 2016 Closure Properties Decidability Summary Closure Properties Closure Properties Decidability Summary

280 views • 27 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

Semantics and Verification 2005 Lecture 7 bisimulation as a fixed point Hennessy-Milner logic

Bisimulation as a Fixed Point Hennessy-Milner Logic with One Recursive Definition Selection of Temporal Properties Semantics and Verification 2005 Lecture 7 bisimulation as a fixed point Hennessy-Milner logic with recursively defined variables

490 views • 12 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.62k 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

325 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 =

416 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

607 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

840 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

566 views • 31 slides

Download document

More recommend

Explore More Topics

Stay informed with curated content and fresh updates.

animals pets art culture automotive transportation business finance computer internet construction architecture education-career electronics communication

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

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:

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

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

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

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

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

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

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

Branching for PDEs Xavier Warin CEMRACS July Xavier Warin Branching for PDEs

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

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

Lecture 3: Decidability January 11, 2011 Lecture 3, Slide 1 ECS 235B, Foundations of Information

Computational Learning Theory 1 / 22 Decidability Computation Decidability which

Decidability Decidability and Symbolic Symbolic Verification Symbolic Symbolic Verification

Theory of Computer Science C4. Regular Languages: Closure Properties and Decidability Malte

Approximating Probabilistic Bisimulation by Introduction Background Conditional Expectation

Semantics and Verification 2005 Lecture 7 bisimulation as a fixed point Hennessy-Milner logic

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

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

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

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

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

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

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

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

Explore More Topics

Sambuz

Useful Links

Newsletter

Mail Us

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

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:

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

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

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

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

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

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

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

Branching for PDEs Xavier Warin CEMRACS July Xavier Warin Branching for PDEs

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

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

Lecture 3: Decidability January 11, 2011 Lecture 3, Slide 1 ECS 235B, Foundations of Information

Computational Learning Theory 1 / 22 Decidability Computation Decidability which

Decidability Decidability and Symbolic Symbolic Verification Symbolic Symbolic Verification

Theory of Computer Science C4. Regular Languages: Closure Properties and Decidability Malte

Approximating Probabilistic Bisimulation by Introduction Background Conditional Expectation

Semantics and Verification 2005 Lecture 7 bisimulation as a fixed point Hennessy-Milner logic

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

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

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

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

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

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

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

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

Explore More Topics

Sambuz

Useful Links

Newsletter

Mail Us

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