Organizers

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

Information

Wednesdays, 2:15 p.m. , room: 5440

Research fields

List of talks

April 25, 2012, 2:15 p.m.
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 …
April 18, 2012, 2:15 p.m.
Anca Muscholl (LaBRI, Bordeaux)
joint work with B. Genest, H. Gimbert and I. Walukiewicz (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 …
April 4, 2012, 2:15 p.m.
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 …
March 28, 2012, 2:15 p.m.
Piotr Hofman (Uniwersytet Warszawski)
joint work with Patrick Totzke (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 …
March 21, 2012, 2:15 p.m.
Eryk Kopczyński (Uniwersytet Warszawski)
joint work with Anuj Dawar, Erich Graedel, Bjarki Holm, Wied Pakusa) - continuatio (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 …
March 14, 2012, 2:15 p.m.
Eryk Kopczyński (Uniwersytet Warszawski)
joint work with Anuj Dawar, Erich Graedel, Bjarki Holm, Wied Pakusa (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 …
March 7, 2012, 2:15 p.m.
Sławomir Lasota (Uniwersytet Warszawski)
joint work with Mikołaj Bojańczyk (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 …
Feb. 29, 2012, 2:15 p.m.
Michał Skrzypczak (Uniwersytet Warszawski)
Descriptive properties of regular languages of thin trees
Feb. 22, 2012, 2:15 p.m.
Mikołaj Bojańczyk (Uniwersytet Warszawski)
joint work with Thomas Place (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 …
Feb. 15, 2012, 2:15 p.m.
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 …
Feb. 8, 2012, 2:15 p.m.
-
No seminar
Feb. 1, 2012, 2:15 p.m.
-
No seminar
Jan. 25, 2012, 2:15 p.m.
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 …
Jan. 18, 2012, 2:15 p.m.
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 …
Jan. 11, 2012, 2:15 p.m.
Thomas Place (Uniwersytet Warszawski)
joint work with Mikołaj Bojańczyk (Regular languages of infinite trees that are boolean combinations of open sets - continuation)
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 …