. "1"^^ . . . "Neuvedeno."@en . "1"^^ . . "Main results of the project contribute to the area of basic research in a\u00A0theory infinite-state concurrent systems.\u00A0Some both standard and originally introduced models of\u00A0 processes have been investigated and their properties have been studied including"@en . "N\u00E1vrh je motivov\u00E1n jednou z \u017Eiv\u00FDch oblast\u00ED sou\u010Dasn\u00E9ho v\u00FDzkumu t\u00FDkaj\u00EDc\u00EDho se form\u00E1ln\u00ED verifikace (a tedy i modelov\u00E1n\u00ED a anal\u00FDzy) nekone\u010Dn\u011B stavov\u00FDch soub\u011B\u017En\u00FDch (concurrent) syst\u00E9m\u016F, kde verifikac\u00ED se rozum\u00ED (zkoum\u00E1n\u00ED rozhodnutelnosti a slo\u017Eitosti)ov\u011B\u0159ov\u00E1n\u00ED jist\u00FDch s\u00E9mantick\u00FDch ekvivalenc\u00ED t\u011Bchto syst\u00E9m\u016F a jejich tempor\u00E1ln\u011B logick\u00FDch vlastnost\u00ED. V posledn\u00ED dob\u011B bylo v dan\u00E9 oblasti dosa\u017Eeno zaj\u00EDmav\u00FDch v\u00FDsledk\u016F,nap\u0159.\\,pro kalkuly BPA, BPP, PA, PDA a Petriho s\u00EDt\u011B, k nim\u017E p\u0159isp\u011Bly i grantov\u00E9 projektyGA\u010CR reg.\u010D. 201/93/2123, 210/97/0456 a 210/00/0400 \u0159e\u0161en\u00E9 t\u00FDmem, kter\u00FD p\u0159edkl\u00E1d\u00E1 tento n\u00E1vrh. Hlavn\u00EDm c\u00EDlem navrhovan\u00E9ho projektu je systematicky prozkoumat zm\u00EDn\u011Bn\u00E9 a p\u0159\u00EDbuzn\u00E9 modely a zam\u011B\u0159it se na charakterizaci rozhodnuteln\u00FDch podt\u0159\u00EDd vzhledem kb\u011B\u017En\u00FDm s\u00E9mantick\u00FDm ekvivalenc\u00EDm (a k adekv\u00E1tn\u00EDm p\u0159eduspo\u0159\u00E1d\u00E1n\u00EDm), na jejich vz\u00E1jemn\u00E9 vztahy a expresibilitu (v\u010Detn\u011B testov\u00E1n\u00ED regularity a mo\u017Enost\u00ED kone\u010Dn\u00E9 charakterizace) a na rozhodnuteln\u00E9 mod\u00E1ln\u00ED a tempor\u00E1ln\u00ED logiky, \u010Di jejich rozumn\u00E9 fragmenty. D\u00E1le" . . . "Verification of infinite-state systems"@en . "Verifikace nekone\u010Dn\u011B stavov\u00FDch syst\u00E9m\u016F" . . . . . . "2009-01-15+01:00"^^ . "http://www.isvav.cz/projectDetail.do?rowId=GA201/03/1161"^^ . . . . "52"^^ . . "52"^^ . "This project proposal is motivated by one of the current research trends in concurrency theory, i.e. by modelling, analysis and verification of concurrent infinite state systems. Verification is understood as (an examination of possibly algorithmic)checking of semantic equivalences between these systems (processes) or checking their properties expressed in suitable modal logics etc. Recently, some interesting results have been achieved in this area, e.g. for calculi BPA, PDA, BPP, PA and Petrinets; some contributions were made by members of the team submitting this proposal. The main goal is to investigate the mentioned and related classes with aims to characterise (sub)classes w.r.t. decidability of (some) equivalences and preorders, todescribe their mutual relationship and relative expressibility (incl. regularity and so called characterisations w.r.t. preorders), and to study complexity of respective decision algorithms. Also it is suggested to study decidability and complexity"@en . "Hlavn\u00ED v\u00FDsledky pat\u0159\u00ED do oblasti z\u00E1kladn\u00EDho v\u00FDzkumu v oblasti form\u00E1ln\u00ED verifikace nekone\u010Dn\u011B stavov\u00FDch soub\u011B\u017En\u00FDch (concurrent) syst\u00E9m\u016F, a to\u00A0jak\u00A0pro standardn\u00ED modely proces\u016F, tak i jejich roz\u0161\u00ED\u0159en\u00ED.\u00A0Na t\u011Bchto t\u0159\u00EDd\u00E1ch proces\u016F byly studov\u00E1ny zejm\u00E9na\u00A0probl\u00E9"@cs . "0"^^ . . . . "GA201/03/1161" . . .