Organizatorzy

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

Informacje

środy, 14:15 , sala: 5050

Dziedziny badań

Lista referatów

13 czerwca 2012 13:15
Violeta Manevska (St. Clement of Ohrid University of Bitola, Macedonia)
Generalization of the Theory of Finite Semigroup Automata
Observing the automata, we can see that they, during their work, make a transition from one state to another, on which a word from an alphabet corresponds, and in the end they finish in some …
6 czerwca 2012 14:15
Szymon Toruńczyk (Uniwersytet Warszawski)
Imperative programming with FM-sets
I will describe a rather natural programming language for working with orbit-finite Fraenkel-Mostowski sets (aka "nominal" sets).
30 maja 2012 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Which data words are simple from an XPath perspective?
XPath satisfiability is undecidable. However, when doing the undecidability proof, one produces formulas that are only satisfied by very artificial data words. We propose a measure of data words, emulating tree-width for graphs, such that …
23 maja 2012 14:15
Tony Tan (University of Edinburgh)
An Automata Model for Trees with Ordered Data Values
Data trees are trees in which each node, besides carrying a label from a finite alphabet,also carries a data value from an infinite domain.They have been used as an abstraction model for reasoning tasks on …
16 maja 2012 14:15
Artur Jeż (Uniwersytet Wrocławski)
Recompression-based PSPACE algorithm for word equations.
In this talk I will present an application of a simple technique of local recompression, to word equations. The technique is based on iterative replacement of pairs of letters appearing in the equation by a …
9 maja 2012 14:15
Nathanael Fijalkow (joint work with Hugo Gimbert and Youssouf Oualhadj) (Uniwersytet Warszawski)
Deciding the value 1 problem for probabilistic leaktight automata
In this talk, I will present some recent work on the value 1 problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1?This problem …
25 kwietnia 2012 14:15
Igor Walukiewicz (LaBRI, Bordeaux)
Verification on higher-order recursive schemes
We propose a new approach to analysing higher-order recursive schemes. Higher-order recursive schemes were introduced by Damm in the 80-ties as a respelling of simply-typed lambda calculus with fixpoints (lambda-Y). In this century the interest …
18 kwietnia 2012 14:15
Anca Muscholl (LaBRI, Bordeaux)
Asynchronous games over tree architectures
The control problem starts with a plant and asks to restrict its controllable actions in such a way that a given specification is met. The synthesis problem can be seen as a special case of …
4 kwietnia 2012 14:15
Paweł Parys (Uniwersytet Warszawski)
Collapsible Pushdown Systems
I will briefly describe two results (the second one is a joint work with A. Kartzow). One is that collapsible pushdown systems are more expressible that higher-order pushdown systems without collapse, for any level. This …
28 marca 2012 14:15
Piotr Hofman (Uniwersytet Warszawski)
Approximants techniques against weak bisimulation for BPP
I will briefly present Basic Parallel Processes and the problem of weak bisimulation. Next I will introduce idea of the approximants technique and show a few known facts about them. Then I will present counterexample …
21 marca 2012 14:15
Eryk Kopczyński (Uniwersytet Warszawski)
Logics with algebraic operators
The quest for a logic for PTIME is one of the central open problems in both finite model theory and database theory. Specifically, it asks whether there is a logic in which a class of …
14 marca 2012 14:15
Eryk Kopczyński (Uniwersytet Warszawski)
Logics with algebraic operators
The quest for a logic for PTIME is one of the central open problems in both finite model theory and database theory. Specifically, it asks whether there is a logic in which a class of …
7 marca 2012 14:15
Sławomir Lasota (Uniwersytet Warszawski)
Application of nominal sets to machine-independent characterization of timed languages
We introduce a variant of nominal sets that is well-suited for languages recognized by timed automata. We state and prove a machine-independent characterization of languages recognized by deterministic timed automata. Finally, in the setting of …
29 lutego 2012 14:15
Michał Skrzypczak (Uniwersytet Warszawski)
Descriptive properties of regular languages of thin trees
22 lutego 2012 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Model theory with nominal sets
Using nominal sets, we define a uniform approach to logics over data words, data trees, data graphs and so on. The key technical result is that, in the equality symmetry, formulas that quantify over data …