Project information
Institute for Theoretical Computer Science
- Project Identification
- 1M0545
- Project Period
- 1/2005 - 12/2011
- Investor / Pogramme / Project type
-
Ministry of Education, Youth and Sports of the CR
- Research Centres (National Research Programme)
- MU Faculty or unit
- Faculty of Informatics
- Project Website
- http://www.fi.muni.cz/iti/
- Cooperating Organization
-
Institute of Mathematics of the ASCR, v. v. i.
- Responsible person prof. RNDr. Pavel Pudlák, DrSc.
- Responsible person doc. RNDr. Jiří Šíma, DrSc.
- Responsible person prof. RNDr. Jaroslav Nešetřil, DrSc.
- Responsible person prof. RNDr. Zdeněk Ryjáček, DrSc.
The subject of the research activities of the institute are methods, algorithms, and structures of theoretical computer science, and their applications in information technologies.
Publications
Total number of publications: 240
2009
-
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems (INFINITY 2006, 2007, 2008), year: 2009
-
On Determinism in Modal Transition Systems
Theoretical Computer Science, year: 2009, volume: 410/2009, edition: 41
-
On the memory consumption of probabilistic pushdown automata
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), year: 2009
-
Polynomial Operators on Classes of Regular Languages
Algebraic Informatics, year: 2009
-
Qualitative Reachability in Stochastic BPA Games
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, year: 2009
-
Quantitative Model Checking of Systems with Degradation
2009 Sixth International Conference on the Quantitative Evaluation of Systems, year: 2009
-
Reachability in Stochastic Timed Games
Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, greece, July 5-12, 2009,Proceedings, Part II, year: 2009
-
Reachability is decidable for weakly extended process rewrite systems
Information and Computation, year: 2009, volume: 207, edition: 6
-
Regularity in PDA Games Revisited
Electronic Notes in Theoretical Computer Science, year: 2009, volume: 2009, edition: 251
-
SOFSEM 2009: Theory and Practice of Computer Science
Year: 2009, type: