Project information
(Un)decidable Problems in Process Algebras
- 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
2001
-
Deciding Bisimulation-Like Equivalences with Finite-State Processes
Theoretical Computer Science, year: 2001, volume: 258, edition: 1-2
-
Model-Checking LTL with Regular Valuations for Pushdown Systems
Proceedings of 4th International Symposium on Theoretical Aspects of Computer Software (TACS 2001), year: 2001
2000
-
Effective Decomposability of Sequential Behaviours.
Theoretical Computer Science, year: 2000, volume: 242, edition: 1-2
-
Efficient Verification Algorithms for One-Counter Processes
Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), year: 2000
-
On Simulation-Checking with Sequential Systems
Proceedings of 6th Asian Computing Science Conference (ASIAN 2000), year: 2000
-
Simulation and Bisimulation over One-Counter Processes
Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), year: 2000
1999
-
Comparing Expressibility of Normed BPA and Normed BPP Processes.
Acta informatica, year: 1999, volume: 36, edition: 3
-
On Finite Representations of Infinite-State Behaviours.
Information Processing Letters, year: 1999, volume: 70, edition: 1
-
Regularity of normed PA processes
Information Processing Letters, year: 1999, volume: 72, edition: 1-2
-
Simulation Preorder on Simple Process Algebras
Proceedings of 26th International Colloquium on Automata, Languages and Programming (ICALP'99), year: 1999