Organizatorzy

prof. dr hab. Mikołaj Bojańczyk
prof. dr hab. Damian Niwiński

Informacje

środy, 14:15 , sala: 5440

Dziedziny badań

Lista referatów

17 grudnia 2014 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Monads rulez (note the change of room)
The algebraic approach to regular languages is to use monoids instead of automata. The algebraic approach has been extended to other settings, such as infinite words, countable total orders, and various kinds of trees. I …
10 grudnia 2014 14:15
Adam Witkowski (Uniwersytet Warszawski)
Datalog over trees strikes back
I will present the proof of decidability of containment of monadic, connected, linear Datalog programs over trees with infinite alphabet.
3 grudnia 2014 14:15
Marcin Przybyłko (Uniwersytet Warszawski)
Winning a Tree Game
Tree games extend standard turn based games by introducing so-called branching positions. When a player reaches such position, game automatically splits into several independent and concurrently executed sub-games. Unfortunately, this behavior may deprive players of …
26 listopada 2014 14:15
Nathanaël Fijalkow (Uniwersytet Warszawski)
(Hopefully) the last talk about the value 1 problem for probabilistic automat)
Since I started my PhD, I already spoke twice at this seminar about the value 1 problem for probabilistic automata. This talk shall be the last on this topic, as it hopefully answers the initial …
19 listopada 2014 14:15
Filip Murlak (Uniwersytet Warszawski)
Consistency of injective tree patterns (joint work with Claire David and Nadime Francis)
I will talk about satisfiability problems for tree patterns under different semantics. I will focus on the following problem: decide if a given tree pattern can be matched injectively in some tree from a fixed …
12 listopada 2014 14:15
Joost Winter (Uniwersytet Warszawski)
The coalgebraic approach to weighted automata: an introduction
In this talk, I will give an overview of how weighted automata can be seen as coalgebras and bialgebras. The coalgebraic approach to weighted automata was developed by Rutten, Bonsangue, Bartels, Silva, Bonchi, and others, …
5 listopada 2014 14:15
Ranko Lazic (University of Warwick)
Multi-dimensional energy games and related problems
I shall present some recent work on multi-dimensional energy games, which happen to have strong connections to several questions involving finite-system simulations, zero-reachability games and alternating termination of vector addition systems.The work is joint with …
29 października 2014 14:15
Henryk Michalewski (Uniwersytet Warszawski)
Category and Measure in the Monadic Second Order Theory of Trees (joint work with Matteo Mio)
The decidability of the "Satisfiability" problem is a majoropen problem in the area of logics of probabilistic programs such as,e.g., PCTL*.We introduce an extension of "MSO with Null quantifier": MSO+N. Thesystem MSO+N is sufficiently expressive …
22 października 2014 14:15
Paweł Parys (Uniwersytet Warszawski)
First-Order Logic on CPDA Graphs
It is known that configuration graphs of higher-order pushdown automata (without the collapse operation) coincide with graphs in the Caucal hierarchy. In particular these graphs have decidable MSO theory. The next step is to consider …
15 października 2014 14:15
Lorenzo Clemente (Uniwersytet Warszawski)
Beyond worst-case analysis for mean-payoff games
Mean-payoff games are classical quantitative games where the objective is to optimise the long-term average payoff.In this purely adversarial setting, one is interested in whether Player 0 has a strategy that guarantees a certain mean-payoff …
8 października 2014 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Clones and tree languages (joint work with Henryk Michalewski)
I will talk about work in progress, which tries to connect• the project to classify fragments of MSO on finite trees, e.g. decide which regular languages of finite trees are definable in first-order logic• results …
1 października 2014 14:15
Nathanael Fijalkow (Uniwersytet Warszawski)
Playing Safe
The general question we consider is to characterize the memory size of winning strategies in two-player games.In this talk, I will show that for the special case of safety conditions (aka topologically closed conditions), the …
25 czerwca 2014 14:15
Filip Mazowiecki (Uniwersytet Warszawski)
Decidability of Weak Logics with Deterministic Transitive Closure (joint work with Witold Charatonik and Emanuel Kieroński)
The deterministic transitive closure operator, added to languages containing even only two variables, allows to express many natural properties of a binary relation, including being a linear order, a tree, a forest or a partial …
18 czerwca 2014 14:15
Jan Rutten (CWI and Radboud Universiteit Nijmegen)
The dual equivalence of equations and coequations for automata
Because of the isomorphism:(X x A) -> X = X -> (A -> X)the transition structure t: X -> (A -> X)of a deterministic automaton with state set Xand with inputs from an alphabet A …
4 czerwca 2014 14:15
Bartek Klin (Uniwersytet Warszawski)
Distributive laws of monads over comonads can't be formatted
We use bialgebraic methods to prove that bialgebraic methods are useless. Specifically, we show that distributive laws of monads over comonads, which are a common abstract generalizationof some concrete formats of well-structured operational definitions, do …