. . . . "Rozhodnutelnost a slo\u017Eitost observa\u010Dn\u00EDch ekvivalenc\u00ED na nekone\u010Dn\u011B stavov\u00FDch procesech" . . "0"^^ . . . . "http://www.isvav.cz/projectDetail.do?rowId=GA201/99/D026"^^ . . "GA201/99/D026" . "Decidability and complexity of observational equivalences on infinite - state processes"@en . . . . "The aim of the project is to contribute new knowledge to the study of concurrent systems, inparticular with regard to the decidability of the problems connected to verification of infinite - state processes. The main question we want to address is the testing of certain observational equivalences on potentially infinite - state processes. In particular we want to study strong, and weak bisimulation equivalences on various process algebras, mainly BPA and BPPA, and their extensions PDA and PDDA, from the point of view of decidability and computational optimality of decision procedures that might exist. For strong bisimulation equivalence we want to find out whether there exist feasible (polynomial) decision algorithms for the aforementionedprocess algebras. In the case of weak bisimulation equivalence we want to investigate whether it is decidable on these classes of processes."@en . "Projekt si klade za c\u00EDl p\u0159isp\u011Bt nov\u00FDmi poznatky ke studiu soub\u011B\u017En\u00FDch syst\u00E9m\u016F, zejm\u00E9na v oblasti algoritmick\u00E9 rozhodnutelnosti probl\u00E9m\u016F souvisej\u00EDc\u00EDch s verifikac\u00ED proces\u016F s nekone\u010Dn\u011B mnoha stavy. Hlavn\u00EDm probl\u00E9mem, na kter\u00FD se chceme zam\u011B\u0159it, je testov\u00E1n\u00EDjist\u00FDch observa\u010Dn\u00EDch ekvivalenc\u00ED na potenci\u00E1ln\u011B nekone\u010Dn\u011B stavov\u00FDch procesech. Konkr\u00E9tn\u011B chceme zkoumat silnou a slabou bisimula\u010Dn\u00ED ekvivalenci na r\u016Fzn\u00FDch algebr\u00E1ch proces\u016F, p\u0159edev\u0161\u00EDm BPA a BPPA, a jejich nadt\u0159\u00EDd\u00E1ch PDA, PDDA, z hlediska rozhodnutelnosti a algoritmick\u00E9 optim\u00E1lnosti eventu\u00E1ln\u00EDch rozhodovac\u00EDch procedur. Pro silnou bisimulaci chceme zjistit, zda existuj\u00ED efektivn\u00ED (polynomi\u00E1ln\u00ED) rozhodovac\u00ED algoritmy pro tyto algebry. V p\u0159\u00EDpad\u011B slab\u00E9 bisimulace chceme zkoumat, zda je v\u016Fbec rozhodnuteln\u00E1 na t\u011Bchto t\u0159\u00EDd\u00E1ch proces\u016F." . . "Projekt byl p\u0159ed\u010Dasn\u011B ukon\u010Den vzhledem k pracovn\u00EDmu pobytu \u0159e\u0161itelky v USA. Pr\u00E1ce na projektu m\u00E1 teoretick\u00E9 v\u00FDstupy obsa\u017Een\u00E9 ve dvou v\u00FDzkumn\u00FDch zpr\u00E1v\u00E1ch. V\u00FDsledky projektu se t\u00FDkaj\u00ED teorie soub\u011B\u017Enosti. \u010Cerp\u00E1n\u00ED finan\u010Dn\u00EDch prost\u0159edk\u016F nevykazuje \u017E\u00E1dn\u00E9 nedos"@cs . . "0"^^ . "4"^^ . "4"^^ . "1"^^ .