Go to main content | Go to main menu | Go to search

Project information
(Un)decidable Problems in Process Algebras

Information

This project doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official project website can be found on muni.cz.
Investor logo
Project Identification
GA201/98/P046
Project Period
1/1998 - 12/2000
Investor / Pogramme / Project type
Czech Science Foundation
  • Standard Projects
MU Faculty or unit
Faculty of Informatics
Project Website
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.

Publications

Total number of publications: 15

1999

1998

Previous 1 2 Next

You are running an old browser version. We recommend updating your browser to its latest version.

More info