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
2005
-
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances
Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005), year: 2005
-
Reachability Analysis of Multithreaded Software with Asynchronous Communication
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, year: 2005
-
Reachability of Hennessy - Milner properties for weakly extended PRS
FSTTCS 2005: 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, year: 2005
-
Recursion vs. Replication in Simple Cryptographic Protocols
Proceedings of 31st Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'05), year: 2005
-
Refining Undecidability Border of Weak Bisimilarity.
BRICS Notes Series, year: 2005, volume: 2005, edition: NS-05-4
-
Refining Undecidability Border of Weak Bisimilarity. (full version of INFINITY 2005 paper)
Year: 2005, type: R&D Presentation
-
Remarks on multiple entry deterministic finite automata
Proc. Descriptional Complexity of Formal Systems 7th Workshop, year: 2005
-
Test input generation for red-black trees using abstraction
Automated Software Engineering, year: 2005
-
The stuttering principle revisited
Acta informatica, year: 2005, volume: 41, edition: 7/8
-
Timed-Arc Petri Nets vs. Networks of Timed Automata
Proceedings of the 26th International Conference on Application and Theory of {P}etri Nets (ICATPN 2005), year: 2005