Informace o projektu
Rozhodnutelné problémy v algebrách procesů
- Kód projektu
- GA201/98/P046
- Období řešení
- 1/1998 - 12/2000
- Investor / Programový rámec / typ projektu
-
Grantová agentura ČR
- Standardní projekty
- Fakulta / Pracoviště MU
- Fakulta informatiky
- WWW stránky projektu
- http://www.fi.muni.cz/usr/kucera/projects/GACR-201-98-P046.html.cz
The aim of the project is to bring new results in the theory of concurrent systems, especially in the area of verification of infinite-state systems. Main research priorities of the project can be summarized as follows: (1) An exact comparison of express ibility of various models for infinite-state systems. (2) Decidability and complexity of the equivalence-testing problem for processes which are defined in different types of syntax. (3) The problem of finite representation of infinite-state systems. Dec idability of the regularity problem for infinite-state systems. (4) Effective parallelization of infinite-state processes.
Publikace
Počet publikací: 15
1999
-
Simulation Preorder on Simple Process Algebras
Technical Report TUM, rok: 1999, ročník: 1999, vydání: TUM-I9902
-
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99), rok: 1999
1998
-
Bisimilarity of Processes with Finite-State Systems
Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP'98), rok: 1998
-
Deciding Bisimulation-Like Equivalences with Finite-State Processes
Technical Report TUM, rok: 1998, ročník: 1998, vydání: TUM-I9805
-
Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time
Technical Report TUM, rok: 1998, ročník: 1998, vydání: TUM-I9830