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

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 (joint work with B. Genest, H. Gimbert and I. Walukiewicz)
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 (joint work with Patrick Totzke)
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 (joint work with Anuj Dawar, Erich Graedel, Bjarki Holm, Wied Pakusa) - continuatio)
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 (joint work with Anuj Dawar, Erich Graedel, Bjarki Holm, Wied Pakusa)
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 (joint work with Mikołaj Bojańczyk)
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 (joint work with Thomas Place)
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 …
15 lutego 2012 14:15
Martin Zimmermann (Uniwersytet Warszawski)
Solving Infinite Games with Bounds
In this talk I will present results reported in my PhD thesis.Parameterized linear temporal logic (PLTL) is an extension of Linear Temporal Logic (LTL) by temporal operators equipped with variables for time bounds. One can …
8 lutego 2012 14:15
-
No seminar
1 lutego 2012 14:15
-
No seminar
25 stycznia 2012 14:15
Tomasz Idziaszek (Uniwersytet Warszawski)
An algebra for languages of infinite thin trees - continuation
Still there is no satisfactory algebraic framework which deals with languages of infinite trees. For example, a framework which we used with Mikołaj to effectively characterize EF logic is an algebra with infinite number of …
18 stycznia 2012 14:15
Tomasz Idziaszek (Uniwersytet Warszawski)
An algebra for languages of infinite thin trees
Still there is no satisfactory algebraic framework which deals with languages of infinite trees. For example, a framework which we used with Mikołaj to effectively characterize EF logic is an algebra with infinite number of …
11 stycznia 2012 14:15
Thomas Place (Uniwersytet Warszawski)
Regular languages of infinite trees that are boolean combinations of open sets - continuation (joint work with Mikołaj Bojańczyk)
This is the continuation of last week talk. Last week I presented a decidable characterization of the class of trees languages definable by boolean combinations of open sets. This week I will present part of …