Nie jesteś zalogowany |
Cotygodniowe seminarium badawcze
Organizatorzy
- prof. dr hab. Mikołaj Bojańczyk
- prof. dr hab. Damian Niwiński
Informacje
środy, 14:15 , sala: 5440Dziedziny badań
Lista referatów
-
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 …
-
-
-
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 …
-
4 stycznia 2012 14:15
Thomas Place (Uniwersytet Warszawski)
Regular languages of infinite trees that are boolean combinations of open sets (joint work with Mikołaj Bojańczyk)
This talk will be about boolean (not necessarily positive)combinations of open sets. I will present a decidable characterizationof the regular languages of infinite trees that are boolean combinationof open sets. In other words, I will …
-
-
