Goal of the Talk Theorem The class of languages recognisable by T -coalgebra automata is closed under taking complements.
|
|
- Bryce Stanley
- 7 years ago
- Views:
Transcription
1 Complementation of Coalgebra Automata Christian Kissig (University of Leicester) joint work with Yde Venema (Universiteit van Amsterdam) 07 Sept 2009 / Universitá degli Studi di Udine / CALCO 2009
2 Goal of the Talk Theorem The class of languages recognisable by T -coalgebra automata is closed under taking complements.
3 Goal of the Talk Theorem The class of languages recognisable by T -coalgebra automata is closed under taking complements. T preserves weak pullbacks T restricts to finite sets T is standard
4 Outline 1. One Step Complementation Lemma Moss Modality Boolean Dual of Moss Modality 2. Game Bisimulation Parity Graph Games Basic Sets and Local Games Powers and Game Normalisation Game Bisimulation 3. Complementation Lemma for Coalgebra Automata Coalgebra Automata Complementation of Trans-alternating Automata Equivalence of Transalternating and Alternating Automata
5 Outline 1. One Step Complementation Lemma Moss Modality Boolean Dual of Moss Modality 2. Game Bisimulation Parity Graph Games Basic Sets and Local Games Powers and Game Normalisation Game Bisimulation 3. Complementation Lemma for Coalgebra Automata Coalgebra Automata Complementation of Trans-alternating Automata Equivalence of Transalternating and Alternating Automata
6 Moss Modality Definition (Moss Modality) α LT Q where α T LQ where L is the functor taking a set Q to the set of bounded lattice terms t ::= q Q t t t t over Q
7 Moss Modality Definition (Moss Modality) α LT Q where α T LQ Let S = S,σ : S T S, s I and s S, then S, s α iff (σ(s),α) T ( ) where L is the functor taking a set Q to the set of bounded lattice terms t ::= q Q t t t t over Q
8 Moss Modality Definition (Moss Modality) α LT Q where α T LQ Let S = S,σ : S T S, s I and s S, then S, s α iff (σ(s),α) T ( ) where L is the functor taking a set Q to the set of bounded lattice terms t ::= q Q t t t t over Q Example For T = P ω, we get α α [α]
9 Positive Coalgebraic Logics Definition (Positive Coalgebraic Logics) LQ is the set of depth-zero formulas
10 Positive Coalgebraic Logics Definition (Positive Coalgebraic Logics) LQ is the set of depth-zero formulas LT ω LQ is the set of depth-one formulas where T ω (X ) := {T Y Y ω X } is the finitary version of T T ω (X ) := { α α T ω X }
11 One-Step Semantics of Positive Coalgebraic Logics Definition (One-Step Semantics) Valuation V : Q P(S)
12 One-Step Semantics of Positive Coalgebraic Logics Definition (One-Step Semantics) Valuation V : Q P(S) s V 0 q iff s V (q) σ V 1 α if (σ, α) T ( V 0 )
13 One-Step Semantics of Positive Coalgebraic Logics Definition (One-Step Semantics) Valuation V : Q P(S) s V 0 q iff s V (q) σ V 1 α if (σ, α) T ( V 0 ) Definition (Boolean Duals of Depth-One Formulas) Depth-Zero Formulas a and b are boolean duals if for all sets S, all valuations V : Q P(S), and all s S s V c 0 a iff s V 0 b where V c (q) := P(S) \ V (q) is the complementary valuation
14 One-Step Semantics of Positive Coalgebraic Logics Definition (One-Step Semantics) Valuation V : Q P(S) s V 0 q iff s V (q) σ V 1 α if (σ, α) T ( V 0 ) Definition (Boolean Duals of Depth-One Formulas) Depth-One Formulas a and b are boolean duals if for all sets S, all valuations V : Q P(S), and all s S where s V c 1 a iff s V 1 b V c (q) := P(S) \ V (q) is the complementary valuation
15 One-Step Complementation Lemma Definition (Boolean Dual of ) Let α Tω Q, define a set D(α) T ω PQ as follows { } D(α) := Φ T ω P ω Base(α) (α, Φ) (T ) where Base(α T ω Q) is the smallest X ω Q such that α T ω X
16 One-Step Complementation Lemma Definition (Boolean Dual of ) Let α Tω Q, define a set D(α) T ω PQ as follows { } D(α) := Φ T ω P ω Base(α) (α, Φ) (T ) where Base(α T ω Q) is the smallest X ω Q such that α T ω X α := { (T } )Φ Φ D(α)
17 One-Step Complementation Lemma Definition (Boolean Dual of ) Let α Tω Q, define a set D(α) T ω PQ as follows { } D(α) := Φ T ω P ω Base(α) (α, Φ) (T ) where Base(α T ω Q) is the smallest X ω Q such that α T ω X α := { (T } )Φ Φ D(α) Example For T = P ω, we get α := { {a} a α} { α, }.
18 One-Step Complementation Lemma Theorem (One-Step Complementation Lemma) For all α T ω Q, α and α are Boolean duals. For all sets S, all valuations V : Q P(S), and all s S, s V c 1 α iff s V 1 α
19 One-Step Dualisation Definition (One-Step Dualisation) δ 0 : LQ LQ δ 0 (q) := q δ 0 ( φ) := δ 0 [φ] δ 0 ( φ) := δ 0 [φ] δ 1 : LT ω LQ LT ω LQ δ 1 ( α) := (T δ 0 )α δ 1 ( φ) := δ 1 [φ] δ 1 ( φ) := δ 1 [φ]
20 One-Step Dualisation Definition (One-Step Dualisation) δ 0 : LQ LQ δ 0 (q) := q δ 0 ( φ) := δ 0 [φ] δ 0 ( φ) := δ 0 [φ] δ 1 : LT ω LQ LT ω LQ δ 1 ( α) := (T δ 0 )α δ 1 ( φ) := δ 1 [φ] δ 1 ( φ) := δ 1 [φ] Corollary For any a LTω LQ, the depth-one formulas a and δ 1 (a) are Boolean duals. For all sets S, all valuations V : Q P(S), and all s S, s V c 1 a iff s V 1 δ 1(a)
21 Outline 1. One Step Complementation Lemma Moss Modality Boolean Dual of Moss Modality 2. Game Bisimulation Parity Graph Games Basic Sets and Local Games Powers and Game Normalisation Game Bisimulation 3. Complementation Lemma for Coalgebra Automata Coalgebra Automata Complementation of Trans-alternating Automata Equivalence of Trans-alternating and Alternating Automata
22 Parity Graph Games Definition (Arena) Arenas of parity graph games are structures G = V 0, V 1, E, v I, Ω: V N sets V = V 0 V 1 of positions an edge relation E V V an initial position v I V a priority function Ω : V N with finite range
23 Parity Graph Games Definition (Arena) Arenas of parity graph games are structures G = V 0, V 1, E, v I, Ω: V N sets V = V 0 V 1 of positions an edge relation E V V an initial position v I V a priority function Ω : V N with finite range Definition (Winning Condition) Player Π {0, 1} ( Σ = 1 Π ) wins a total play p of G iff p finite and last(p) V Π p infinite and largest priority occuring infinitely often has parity Π
24 Basic Sets G = V 0, V 1, E, v I, Ω: V N Definition We call a set B V basic if 1. v I B 2. any total play from v B either ends in a terminal position or it passes through another position in B 3. v B iff Ω(v) > 0
25 Local Games G = V 0, V 1, E, v I, Ω with basic set B V, b B Definition (Local Game Trees) V b := T b = V b 0, V b 1, E b, (b) { β V first(β) =b, i < β.β(i) B = i = 0 or i = β 1 V b Π := {β V b last(β) V Π } for both Π {0, 1} E b (β) := {βv v E(β)} }
26 Powers G = V 0, V 1, E, v I, Ω with basic set B V b B, T b = V b 0, V b 1, E b, (b) Definition (Powers) We define the power P Π (b) B of Π {0, 1} (Σ = 1 Π) as { } If β Leaves(T b ), put P Π (β) := {last(β)} If β Leaves(T b ), put {PΠ (γ) γ E b (β)} P Π (β) := { } γ E b (β) Y γ Y γ P Π (γ), all γ P Π (b) := P Π ((b) ) if β V b Π if β V b Σ
27 Powers G = V 0, V 1, E, v I, Ω, basic set B V Π {0, 1}, Σ = 1 Π Proposition Let W be a subset of B. Then the following are equivalent: 1. W P Π (b); 2. Π has a surviving strategy f in G b such that W is the set of next basic positions in some play consistent with f
28 Powers G = V 0, V 1, E, v I, Ω, basic set B V Π {0, 1}, Σ = 1 Π Proposition Let W be a subset of B. Then the following are equivalent: 1. W P Π (b); 2. Π has a surviving strategy f in G b such that W is the set of next basic positions in some play consistent with f Proposition The following are equivalent 1. P Π (b) 2. P Σ (b) = 3. Π has a local winning strategy in G b
29 Game Bisimulation G = V 0, V 1, E, Ω, basic set B V,Π {0, 1} G = V 0, V 1, E, Ω, basic set B V,Π {0, 1 } Definition (Game Simulation) AΠ, Π -game simulation is a relation Z B B such that for all v V and v V with vzv, Z satisfies the structural conditions (pro) W P G Π (v). W P G Π (v ). w W. w W. wzw, (op) W P G Σ (v ). W P G Σ (v). w W. w W. wzw, and the priority conditions (parity) Ω(v) mod 2 = Π iff Ω (v ) mod 2 = Π, (contraction) for all v, w V and v, w V with vzv and wzw, Ω(v) Ω(w) iff Ω(v ) Ω(w ).
30 Game Bisimulation G = V 0, V 1, E, Ω, basic set B V,Π {0, 1} G = V 0, V 1, E, Ω, basic set B V,Π {0, 1 } Definition (Game Bisimulation) Z B B is a Π,Π -game bisimulation if Z is a Π,Π -game simulation Z is a Π,Π-game simulation
31 Game Bisimulation G = V 0, V 1, E, Ω, basic set B V,Π {0, 1} G = V 0, V 1, E, Ω, basic set B V,Π {0, 1 } Definition (Game Bisimulation) Z B B is a Π,Π -game bisimulation if Z is a Π,Π -game simulation Z is a Π,Π-game simulation Theorem If Z B B Π,Π -game bisimulation between parity graph games G and G, then if vzv then v Win Π (G) v Win Π (G )
32 Outline 1. One Step Complementation Lemma Moss Modality Boolean Dual of Moss Modality 2. Game Bisimulation Parity Graph Games Basic Sets and Local Games Powers and Game Normalisation Game Bisimulation 3. Complementation Lemma for Coalgebra Automata Coalgebra Automata Complementation of Trans-alternating Automata Equivalence of Trans-alternating and Alternating Automata
33 Alternating Automata, Syntax Definition (Alternating Automata in Logical Form) Alternating T -automata are structures A = Q,θ : Q LT Q, q I, Ω consisting of a finite set Q of states a transition function θ : Q LT Q an initial state q I Q a priority function Ω : Q N
34 Alternating Automata, Semantics A = Q,θ : Q LT Q, q I, Ω is an alternating automaton S = S,σ : S T S, s I is a pointed T -coalgebra Definition Acceptance games are parity graph games G(A, S) = V, V, E, (q I, s I ), Ω G Position Sets of Admissible Moves Ω G (q, s) Q S - {(θ(q), s)} Ω(q) ( τ, s) LT Q S {(q, s) q τ} 0 ( τ, s) LT Q S {(q, s) q τ} 0 ( α, s) T Q S {Z Q S (α, σ(s)) T Z} 0 Z Q S Z 0
35 Trans-alternating Automata Alternating automata: Q,θ : Q LT Q, q I, Ω Definition (Trans-alternating Automata) Q,θ : Q LT LQ, q I, Ω Definition (Acceptance Games) similar to the acceptance games of alternating automata
36 Complements of Trans-alternating Automata A = Q,θ : Q LT LQ, q I, Ω is a trans-alternating aut on Definition (Complements of Trans-alternating Automata) Define the complementary automaton A c = Q,θ c : Q LT LQ, q I, Ω c such that θ c (q) := δ 1 (θ(q)) Ω c (q) := Ω(q) + 1, for all q Q. δ 0 : LQ LQ δ 0 (q) := q δ 0 ( φ) := δ 0 [φ] δ 0 ( φ) := δ 0 [φ] δ 1 : LT ω LQ LT ω LQ δ 1 ( α) := (T δ 0 )α δ 1 ( φ) := δ 1 [φ] δ 1 ( φ) := δ 1 [φ]
37 Complements of Trans-alternating Automata Theorem For every trans-alternating automaton A, the automaton A c accepts precisely those pointed T -coalgebras that are rejected by A.
38 Trans-alternating and Alternating Automata Theorem There is an effective translation between 1. Alternating Automata 2. Trans-alternating Automata 1 2 is trivial
39 Trans-alternating and Alternating Automata Alternating automata: Q,θ : Q LT Q, q I, Ω Trans-alternating automata: Q,θ : Q LT LQ, q I, Ω Definition (Semi-Transalternating Automata) where Q,θ : Q LT SQ, q I, Ω S is the functor taking a set Q to the set of bounded meet-semilattice terms t ::= q Q t t over Q Definition (Acception Games) similar to the acceptance games of alternating automata
40 Trans-alternating and Alternating Automata Theorem There is an effective translation between 1. Alternating Automata 2. Trans-alternating Automata 3. Semi-Transalternating Automata We showed
41 Size Matters Theorem For every alternating automaton A with n states there is a complementing alternating automaton A c with 2 n n states.
42 Size Matters Theorem For every alternating automaton A with n states there is a complementing alternating automaton A c with 2 n n states. Theorem If T is such that α LT Q for any α T Q, then for any alternating T -automaton of n states there is a complementing alternating automaton with at most n + c states, for some constant c.
43 Some Conclusions Summary Effective Complementation Procedure for Coalgebra Automata Coinductive Method of Game (Bi)Simulation for (some) Parity Graph Games
44 Some Conclusions Summary Effective Complementation Procedure for Coalgebra Automata Coinductive Method of Game (Bi)Simulation for (some) Parity Graph Games Corollaries (Boolean) Coalgebraic Logic is Negation-free Correspondence between (Second-Order Monadic) Coalgebraic Logic and Coalgebra Automata
45 Some Conclusions Summary Effective Complementation Procedure for Coalgebra Automata Coinductive Method of Game (Bi)Simulation for (some) Parity Graph Games Corollaries (Boolean) Coalgebraic Logic is Negation-free Correspondence between (Second-Order Monadic) Coalgebraic Logic and Coalgebra Automata Open Questions Categorical Nature of the Correspondence Characterisation of Game (Bi)Similarity
46 Conclusions and References References Thank You Moss, Coalgebraic Logic, APAL, 1999 Venema, Automata and Fixed Point Logics: a Coalgebraic Perspective, Information and Computation, 2006 Kupke, Venema, Coalgebraic automata theory: basic results, LMCS, 2008 Kupke, Kurz, Venema, Completeness of Finitary Moss Logic, AiML 2008 Kissig, Decidability of S2S, MSc Thesis, ILLC, UvA, 2007 Kissig, Venema, Complementation of Coalgebra Automata van Benthem, Extensive Games as Process Models, 2002
On Winning Conditions of High Borel Complexity in Pushdown Games
Fundamenta Informaticae (2005) 1 22 1 IOS Press On Winning Conditions of High Borel Complexity in Pushdown Games Olivier Finkel Equipe de Logique Mathématique U.F.R. de Mathématiques, Université Paris
More informationα α λ α = = λ λ α ψ = = α α α λ λ ψ α = + β = > θ θ β > β β θ θ θ β θ β γ θ β = γ θ > β > γ θ β γ = θ β = θ β = θ β = β θ = β β θ = = = β β θ = + α α α α α = = λ λ λ λ λ λ λ = λ λ α α α α λ ψ + α =
More informationModels for Quantitative Distributed Systems and Multi-Valued Logics
Universität Leipzig Institut für Informatik Models for Quantitative Distributed Systems and Multi-Valued Logics Master Thesis Leipzig, September 2010 Author Supervisor B.Sc. Martin Huschenbett Master Student
More informationTechniques algébriques en calcul quantique
Techniques algébriques en calcul quantique E. Jeandel Laboratoire de l Informatique du Parallélisme LIP, ENS Lyon, CNRS, INRIA, UCB Lyon 8 Avril 25 E. Jeandel, LIP, ENS Lyon Techniques algébriques en calcul
More informationFinite Projective demorgan Algebras. honoring Jorge Martínez
Finite Projective demorgan Algebras Simone Bova Vanderbilt University (Nashville TN, USA) joint work with Leonardo Cabrer March 11-13, 2011 Vanderbilt University (Nashville TN, USA) honoring Jorge Martínez
More informationTesting LTL Formula Translation into Büchi Automata
Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland
More informationA Hennessy-Milner Property for Many-Valued Modal Logics
A Hennessy-Milner Property for Many-Valued Modal Logics Michel Marti 1 Institute of Computer Science and Applied Mathematics, University of Bern Neubrückstrasse 10, CH-3012 Bern, Switzerland mmarti@iam.unibe.ch
More informationPath Querying on Graph Databases
Path Querying on Graph Databases Jelle Hellings Hasselt University and transnational University of Limburg 1/38 Overview Graph Databases Motivation Walk Logic Relations with FO and MSO Relations with CTL
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationIntroduction to Scheduling Theory
Introduction to Scheduling Theory Arnaud Legrand Laboratoire Informatique et Distribution IMAG CNRS, France arnaud.legrand@imag.fr November 8, 2004 1/ 26 Outline 1 Task graphs from outer space 2 Scheduling
More informationLeft-Handed Completeness
Left-Handed Completeness Dexter Kozen Computer Science Department Cornell University RAMiCS, September 19, 2012 Joint work with Alexandra Silva Radboud University Nijmegen and CWI Amsterdam Result A new
More informationUniversity of Maryland Fraternity & Sorority Life Spring 2015 Academic Report
University of Maryland Fraternity & Sorority Life Academic Report Academic and Population Statistics Population: # of Students: # of New Members: Avg. Size: Avg. GPA: % of the Undergraduate Population
More informationWhich Semantics for Neighbourhood Semantics?
Which Semantics for Neighbourhood Semantics? Carlos Areces INRIA Nancy, Grand Est, France Diego Figueira INRIA, LSV, ENS Cachan, France Abstract In this article we discuss two alternative proposals for
More informationOn strong fairness in UNITY
On strong fairness in UNITY H.P.Gumm, D.Zhukov Fachbereich Mathematik und Informatik Philipps Universität Marburg {gumm,shukov}@mathematik.uni-marburg.de Abstract. In [6] Tsay and Bagrodia present a correct
More informationTotal Degrees and Nonsplitting Properties of Σ 0 2 Enumeration Degrees
Total Degrees and Nonsplitting Properties of Σ 0 2 Enumeration Degrees M. M. Arslanov, S. B. Cooper, I. Sh. Kalimullin and M. I. Soskova Kazan State University, Russia University of Leeds, U.K. This paper
More informationFoundational Proof Certificates
An application of proof theory to computer science INRIA-Saclay & LIX, École Polytechnique CUSO Winter School, Proof and Computation 30 January 2013 Can we standardize, communicate, and trust formal proofs?
More informationReducing Clocks in Timed Automata while Preserving Bisimulation
Reducing Clocks in Timed Automata while Preserving Bisimulation Shibashis Guha Chinmay Narayan S. Arun-Kumar Indian Institute of Technology Delhi {shibashis, chinmay, sak}@cse.iitd.ac.in arxiv:1404.6613v2
More informationOmega Automata: Minimization and Learning 1
Omega Automata: Minimization and Learning 1 Oded Maler CNRS - VERIMAG Grenoble, France 2007 1 Joint work with A. Pnueli, late 80s Summary Machine learning in general and of formal languages in particular
More informationPROCESS AND TRUTH-TABLE CHARACTERISATIONS OF RANDOMNESS
PROCESS AND TRUTH-TABLE CHARACTERISATIONS OF RANDOMNESS ADAM R. DAY Abstract. This paper uses quick process machines to provide characterisations of computable randomness, Schnorr randomness and weak randomness.
More informationMonitoring Metric First-order Temporal Properties
Monitoring Metric First-order Temporal Properties DAVID BASIN, FELIX KLAEDTKE, SAMUEL MÜLLER, and EUGEN ZĂLINESCU, ETH Zurich Runtime monitoring is a general approach to verifying system properties at
More informationReliability Guarantees in Automata Based Scheduling for Embedded Control Software
1 Reliability Guarantees in Automata Based Scheduling for Embedded Control Software Santhosh Prabhu, Aritra Hazra, Pallab Dasgupta Department of CSE, IIT Kharagpur West Bengal, India - 721302. Email: {santhosh.prabhu,
More informationAdditional questions for chapter 4
Additional questions for chapter 4 1. A stock price is currently $ 1. Over the next two six-month periods it is expected to go up by 1% or go down by 1%. The risk-free interest rate is 8% per annum with
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationThe Ergodic Theorem and randomness
The Ergodic Theorem and randomness Peter Gács Department of Computer Science Boston University March 19, 2008 Peter Gács (Boston University) Ergodic theorem March 19, 2008 1 / 27 Introduction Introduction
More informationThe epistemic structure of de Finetti s betting problem
The epistemic structure of de Finetti s betting problem Tommaso Flaminio 1 Hykel Hosni 2 1 IIIA - CSIC Universitat Autonoma de Barcelona (Spain) tommaso@iiia.csic.es www.iiia.csic.es/ tommaso 2 SNS Scuola
More informationOn the Modeling and Verification of Security-Aware and Process-Aware Information Systems
On the Modeling and Verification of Security-Aware and Process-Aware Information Systems 29 August 2011 What are workflows to us? Plans or schedules that map users or resources to tasks Such mappings may
More informationSign changes of Hecke eigenvalues of Siegel cusp forms of degree 2
Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree
More informationAutomata-based Verification - I
CS3172: Advanced Algorithms Automata-based Verification - I Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2006 Supporting and Background Material Copies of key slides (already
More informationCyber-Security Analysis of State Estimators in Power Systems
Cyber-Security Analysis of State Estimators in Electric Power Systems André Teixeira 1, Saurabh Amin 2, Henrik Sandberg 1, Karl H. Johansson 1, and Shankar Sastry 2 ACCESS Linnaeus Centre, KTH-Royal Institute
More informationRemarks on Non-Fregean Logic
STUDIES IN LOGIC, GRAMMAR AND RHETORIC 10 (23) 2007 Remarks on Non-Fregean Logic Mieczys law Omy la Institute of Philosophy University of Warsaw Poland m.omyla@uw.edu.pl 1 Introduction In 1966 famous Polish
More informationStatic analysis of parity games: alternating reachability under parity
8 January 2016, DTU Denmark Static analysis of parity games: alternating reachability under parity Michael Huth, Imperial College London Nir Piterman, University of Leicester Jim Huan-Pu Kuo, Imperial
More informationVerification of hybrid dynamical systems
Verification of hybrid dynamical systems Jüri Vain Tallinn Technical University/Institute of Cybernetics vain@ioc.ee Outline What are Hybrid Systems? Hybrid automata Verification of hybrid systems Verification
More informationUniversität Stuttgart Fakultät Informatik, Elektrotechnik und Informationstechnik
Universität Stuttgart Fakultät Informatik, Elektrotechnik und Informationstechnik Infinite State Model-Checking of Propositional Dynamic Logics Stefan Göller and Markus Lohrey Report Nr. 2006/04 Institut
More informationTree sums and maximal connected I-spaces
Tree sums and maximal connected I-spaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and
More informationAlgebraic Recognizability of Languages
of Languages LaBRI, Université Bordeaux-1 and CNRS MFCS Conference, Prague, August 2004 The general problem Problem: to specify and analyse infinite sets by finite means The general problem Problem: to
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationFun with Henry. Dirk Pattinson Department of Computing Imperial College London
Fun with Henry Dirk Pattinson Department of Computing Imperial College London 1 Example: The Tudors Henry VIII Henry Carey Mary Boleyn There have been speculation that Mary s two children, Catherine and
More informationFixed-Point Logics and Computation
1 Fixed-Point Logics and Computation Symposium on the Unusual Effectiveness of Logic in Computer Science University of Cambridge 2 Mathematical Logic Mathematical logic seeks to formalise the process of
More informationBi-approximation Semantics for Substructural Logic at Work
Bi-approximation Semantics for Substructural Logic at Work Tomoyuki Suzuki Department of Computer Science, University of Leicester Leicester, LE1 7RH, United Kingdom tomoyuki.suzuki@mcs.le.ac.uk Abstract
More informationThe Model Checker SPIN
The Model Checker SPIN Author: Gerard J. Holzmann Presented By: Maulik Patel Outline Introduction Structure Foundation Algorithms Memory management Example/Demo SPIN-Introduction Introduction SPIN (Simple(
More informationAutomata on Infinite Words and Trees
Automata on Infinite Words and Trees Course notes for the course Automata on Infinite Words and Trees given by Dr. Meghyn Bienvenu at Universität Bremen in the 2009-2010 winter semester Last modified:
More informationAlgorithmic Software Verification
Algorithmic Software Verification (LTL Model Checking) Azadeh Farzan What is Verification Anyway? Proving (in a formal way) that program satisfies a specification written in a logical language. Formal
More information2. Illustration of the Nikkei 225 option data
1. Introduction 2. Illustration of the Nikkei 225 option data 2.1 A brief outline of the Nikkei 225 options market τ 2.2 Estimation of the theoretical price τ = + ε ε = = + ε + = + + + = + ε + ε + ε =
More informationStatic Typing for Object-Oriented Programming
Science of Computer Programming 23(1):19 53, 1994. Static Typing for Object-Oriented Programming Jens Palsberg palsberg@daimi.aau.dk Michael I. Schwartzbach mis@daimi.aau.dk Computer Science Department
More informationDegrees of freedom in (forced) symmetric frameworks. Louis Theran (Aalto University / AScI, CS)
Degrees of freedom in (forced) symmetric frameworks Louis Theran (Aalto University / AScI, CS) Frameworks Graph G = (V,E); edge lengths l(ij); ambient dimension d Length eqns. pi - pj 2 = l(ij) 2 The p
More informationGalois Theory III. 3.1. Splitting fields.
Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where
More information(IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems.
3130CIT: Theory of Computation Turing machines and undecidability (IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems. An undecidable problem
More informationAPPLICATION SCHEMES OF POSSIBILITY THEORY-BASED DEFAULTS
APPLICATION SCHEMES OF POSSIBILITY THEORY-BASED DEFAULTS Churn-Jung Liau Institute of Information Science, Academia Sinica, Taipei 115, Taiwan e-mail : liaucj@iis.sinica.edu.tw Abstract In this paper,
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More informationBüchi Complementation Made Tighter
International Journal of Foundations of Computer Science c World Scientific Publishing Company Büchi Complementation Made Tighter Ehud Friedgut Hebrew University, Institute of Mathematics, Jerusalem 91904,
More informationMODEL CHECKING ONE-CLOCK PRICED TIMED AUTOMATA
MODEL CHECKING ONE-CLOCK PRICED TIMED AUTOMATA PATRICIA BOUYER, KIM G. LARSEN, AND NICOLAS MARKEY LSV, CNRS & ENS de Cachan, France Oxford University Computing Laboratory, UK e-mail address: bouyer@lsv.ens-cachan.fr
More informationLambda Calculus between Algebra and Topology. Antonino Salibra
Lambda Calculus between Algebra and Topology Antonino Salibra Thanks Special thanks to Laboratoire PPS (Univ. Paris Diderot) for supporting my research with financial support and very interesting collaborations
More informationIterated Dynamic Belief Revision. Sonja Smets, University of Groningen. website: http://www.vub.ac.be/clwf/ss
LSE-Groningen Workshop I 1 Iterated Dynamic Belief Revision Sonja Smets, University of Groningen website: http://www.vub.ac.be/clwf/ss Joint work with Alexandru Baltag, COMLAB, Oxford University LSE-Groningen
More informationA Propositional Dynamic Logic for CCS Programs
A Propositional Dynamic Logic for CCS Programs Mario R. F. Benevides and L. Menasché Schechter {mario,luis}@cos.ufrj.br Abstract This work presents a Propositional Dynamic Logic in which the programs are
More informationMidterm Practice Problems
6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationImprecise probabilities, bets and functional analytic methods in Łukasiewicz logic.
Imprecise probabilities, bets and functional analytic methods in Łukasiewicz logic. Martina Fedel joint work with K.Keimel,F.Montagna,W.Roth Martina Fedel (UNISI) 1 / 32 Goal The goal of this talk is to
More informationLecture 2: Universality
CS 710: Complexity Theory 1/21/2010 Lecture 2: Universality Instructor: Dieter van Melkebeek Scribe: Tyson Williams In this lecture, we introduce the notion of a universal machine, develop efficient universal
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More informationConstructing Automata from Temporal Logic Formulas : A Tutorial
Constructing Automata from Temporal Logic Formulas : A Tutorial Pierre Wolper Université de Liège, Institut Montefiore, B28, 4000 Liège, Belgium pw@montefiore.ulg.ac.be, http://www.montefiore.ulg.ac.be/~pw/
More informationRegular Expressions with Nested Levels of Back Referencing Form a Hierarchy
Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy Kim S. Larsen Odense University Abstract For many years, regular expressions with back referencing have been used in a variety
More informationarxiv:math/0202219v1 [math.co] 21 Feb 2002
RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France
More informationComputability Theory
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Computability Theory This section is partly inspired by the material in A Course in Mathematical Logic by Bell and Machover, Chap 6, sections 1-10.
More informationNon-deterministic Semantics and the Undecidability of Boolean BI
1 Non-deterministic Semantics and the Undecidability of Boolean BI DOMINIQUE LARCHEY-WENDLING, LORIA CNRS, Nancy, France DIDIER GALMICHE, LORIA Université Henri Poincaré, Nancy, France We solve the open
More informationSOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO
K. Hashimoto Nagoya Math. J. Vol. 77 (1980), 167-175 SOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO Introduction In the theory of integral quadratic
More informationLecture 4: BK inequality 27th August and 6th September, 2007
CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound
More informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
More informationLecture 22: November 10
CS271 Randomness & Computation Fall 2011 Lecture 22: November 10 Lecturer: Alistair Sinclair Based on scribe notes by Rafael Frongillo Disclaimer: These notes have not been subjected to the usual scrutiny
More informationInvariant random subgroups and applications
Department of Mathematics Ben-Gurion university of the Negev. Spa, April 2013. Plan 1 Plan 2 IRS Definitions, Examples, Theorems 3 Essential subgroups 4 Proof of the main theorem IRS Definition Γ a l.c
More informationCS5236 Advanced Automata Theory
CS5236 Advanced Automata Theory Frank Stephan Semester I, Academic Year 2012-2013 Advanced Automata Theory is a lecture which will first review the basics of formal languages and automata theory and then
More informationTransfer of the Ramsey Property between Classes
1 / 20 Transfer of the Ramsey Property between Classes Lynn Scow Vassar College BLAST 2015 @ UNT 2 / 20 Classes We consider classes of finite structures such as K < = {(V,
More informationOptimality of size-degree trade-offs for Polynomial Calculus
Optimality of size-degree trade-offs for Polynomial Calculus NICOLA GALESI and MASSIMO LAURIA Dipartimento di Informatica, Sapienza - Università di Roma There are methods to turn short refutations in Polynomial
More informationMonoid-labeled transition systems
Monoid-labeled transition systems H. Peter Gumm, Tobias Schröder Fachbereich Mathematik und Informatik Philipps-Universität Marburg Marburg, Germany {gumm,tschroed}@mathematik.uni-marburg.de Abstract Given
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationParametric Domain-theoretic models of Linear Abadi & Plotkin Logic
Parametric Domain-theoretic models of Linear Abadi & Plotkin Logic Lars Birkedal Rasmus Ejlers Møgelberg Rasmus Lerchedahl Petersen IT University Technical Report Series TR-00-7 ISSN 600 600 February 00
More informationQuestion Answering and the Nature of Intercomplete Databases
Certain Answers as Objects and Knowledge Leonid Libkin School of Informatics, University of Edinburgh Abstract The standard way of answering queries over incomplete databases is to compute certain answers,
More informationGENTLY KILLING S SPACES TODD EISWORTH, PETER NYIKOS, AND SAHARON SHELAH
GENTLY KILLING S SPACES TODD EISWORTH, PETER NYIKOS, AND SAHARON SHELAH Abstract. We produce a model of ZFC in which there are no locally compact first countable S spaces, and in which 2 ℵ 0 < 2 ℵ 1. A
More informationA first step towards modeling semistructured data in hybrid multimodal logic
A first step towards modeling semistructured data in hybrid multimodal logic Nicole Bidoit * Serenella Cerrito ** Virginie Thion * * LRI UMR CNRS 8623, Université Paris 11, Centre d Orsay. ** LaMI UMR
More informationEmbeddability and Decidability in the Turing Degrees
ASL Summer Meeting Logic Colloquium 06. Embeddability and Decidability in the Turing Degrees Antonio Montalbán. University of Chicago Nijmegen, Netherlands, 27 July- 2 Aug. of 2006 1 Jump upper semilattice
More informationUniversity of Ostrava. Reasoning in Description Logic with Semantic Tableau Binary Trees
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Reasoning in Description Logic with Semantic Tableau Binary Trees Alena Lukasová Research report No. 63 2005 Submitted/to
More informationResearch Note. Bi-intuitionistic Boolean Bunched Logic
UCL DEPARTMENT OF COMPUTER SCIENCE Research Note RN/14/06 Bi-intuitionistic Boolean Bunched Logic June, 2014 James Brotherston Dept. of Computer Science University College London Jules Villard Dept. of
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationModeling and Verification of Sampled-Data Hybrid Systems
Modeling and Verification of Sampled-Data Hybrid Systems Abstract B. Izaias Silva and Bruce H. Krogh Dept. of Electrical and Computer Engineering, Carnegie Mellon University (Izaias /krogh)@cmu.edu We
More information6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games Asu Ozdaglar MIT February 4, 2009 1 Introduction Outline Decisions, utility maximization Strategic form games Best responses
More informationLinear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
More informationOn Streams and Coinduction
On Streams and Coinduction Preface The natural numbers are the most famous instance of an initial algebra and constitute the typical example for the explanation of induction. Similarly and dually, streams
More informationCyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
More informationOn Recognizable Timed Languages FOSSACS 2004
On Recognizable Timed Languages Oded Maler VERIMAG Grenoble France Amir Pnueli NYU and Weizmann New York and Rehovot USA FOSSACS 2004 Nutrition Facts Classical (Untimed) Recognizability Timed Languages
More informationNP-Hardness Results Related to PPAD
NP-Hardness Results Related to PPAD Chuangyin Dang Dept. of Manufacturing Engineering & Engineering Management City University of Hong Kong Kowloon, Hong Kong SAR, China E-Mail: mecdang@cityu.edu.hk Yinyu
More informationCLASSES, STRONG MINIMAL COVERS AND HYPERIMMUNE-FREE DEGREES
Π 0 1 CLASSES, STRONG MINIMAL COVERS AND HYPERIMMUNE-FREE DEGREES ANDREW E.M. LEWIS Abstract. We investigate issues surrounding an old question of Yates as to the existence of a minimal degree with no
More informationEstimating the Degree of Activity of jumps in High Frequency Financial Data. joint with Yacine Aït-Sahalia
Estimating the Degree of Activity of jumps in High Frequency Financial Data joint with Yacine Aït-Sahalia Aim and setting An underlying process X = (X t ) t 0, observed at equally spaced discrete times
More informationThe phase transitions of the planar random-cluster and Potts models with q 1 are sharp
The phase transitions of the planar random-cluster and Potts models with q 1 are sharp Hugo Duminil-Copin and Ioan Manolescu August 28, 2014 Abstract We prove that random-cluster models with q 1 on a variety
More informationA NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES
A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES THEODORE A. SLAMAN AND ANDREA SORBI Abstract. We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: In fact, below
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 15, 2011 Problem: What is the remainder of 6 2000 when divided by 11? Solution: This is a long-winded way of asking for the value of 6 2000 mod
More informationNon-Archimedean Probability and Conditional Probability; ManyVal2013 Prague 2013. F.Montagna, University of Siena
Non-Archimedean Probability and Conditional Probability; ManyVal2013 Prague 2013 F.Montagna, University of Siena 1. De Finetti s approach to probability. De Finetti s definition of probability is in terms
More information1 The Line vs Point Test
6.875 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Low Degree Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz Having seen a probabilistic verifier for linearity
More informationRecursive Timed Automata
Recursive Timed Automata Ashutosh Trivedi and Dominik Wojtczak Computing Laboratory, Oxford University, UK Abstract. We study recursive timed automata that extend timed automata with recursion. Timed automata,
More informationCS 3719 (Theory of Computation and Algorithms) Lecture 4
CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a
More information