Dr. Daniel Hausmann
Every solved research problem gives rise to new questions and problems. But identifying the interesting open problems that have a realistic chance of being solved by us (with a reasonable amount of work) can be a challenge. I am always happy
to discuss such questions in the field of automata, logics and (in particular) games!
Prospective PhD and Postdoctoral Researchers
There are funding oppurtunities for potential PhD and postdoctoral researchers in computer science at the University of Liverpool, subject to the evaluation of the candidate's research plan. If you are interested in coming to Liverpool to do research in computer science, and in case you are interested in working on automata, logics or games (or any combination of these topics), get in touch with me, to start thinking about a plan for joint research! The quickest and easiest way to reach me is usually by e-mail.Potential Research Topics and Open Problems
The following is a very incomplete list of interesting current research topics and open problems; more details will be provided in time.-
Properties of Manna-Pnueli Automata. These automata on infinite words have recently been proposed as a back-end for the analysis of temporal formulas in logics similar to LTL; acceptance conditions of these automata are Boolean combinations of recurrence (Büchi), persistence (co-Büchi), safety and guarantee (reachability) conditions. But not much is known about these automata. To find out more, we might look at such problems as emptiness checking, inclusion checking or determinization of Manna-Pnueli automata, or at the transformation to automata with simpler acceptance conditions.
-
Strategy Improvement for Emerson-Lei Games. Emerson-Lei games are two-player games of infinite duration, played over finite graphs. The winning objectives in such games are Boolean combinations of recurrence (Büchi) and persistence (co-Büchi) objectives. These games have attracted considerable attention in recent research due to their favourable compositionality properties. While various algorithms to solve such games have been devised, implemented and used in practice, there currently is no lazy algorithm for their solution. Such a lazy algorithm would construct the game step by step and could attempt to solve it at any point, possibly finding small solutions to large games without having to explore them fully. Strategy improvement algorithms support lazy game solving in this sense.
In case you are interested in any of the above items, or in any other research topics that seem to have potential for collaboration, please get into contact (the quickest and easiest way to reach me is usually by e-mail).
Contact
| Address: | University of Liverpool | Room: | Office Room 2.16b, George Holt Building | ||
| School of Computer Science and Informatics | Telephone: | -- | |||
| George Holt Building | Fax: | -- | |||
| Liverpool L69 3BX, United Kingdom | E-Mail: | hausmann(at)liverpool.ac.uk |