Informace o projektu
Meze algoritmické verifikovatelnosti nekonečně stavových systémů
| Kód projektu | GA201/97/0456 CEP CORDIS MU WEB INET MU |
|---|---|
| Doba řešení | 01.01.1997–31.12.1999 |
| Stav | ukončený |
| Investor | Grantová agentura ČR |
| Program | Standardní projekty |
| Řešitel za FI | |
| Členové realizačního týmu za FI |
Anotace
Anotace je dostupná pouze v anglickém jazyce.
The project is motivated by a live current research area concerning analysis and verification of complex (infinite state) concurrent systems It is the area of boundaries for algorithmic verification, where verification means checking equivalencies of sys tems, their temporal logic properties etc. Recently, several interesting results have been obtained in the given area, e.g. for calculi BPA, BPP, and Petri nets, to which also the grant of the Czech Grant Agency, No. 201/93/2123, has contributed. The ma