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

Project information
Algorithmic Verification Boundaries for Infinite-State Systems

Information

This project doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official project website can be found on muni.cz.
Investor logo
Project Identification
GA201/97/0456
Project Period
1/1997 - 12/1999
Investor / Pogramme / Project type
Czech Science Foundation
  • Standard Projects
MU Faculty or unit
Faculty of Informatics
Project Website
http://www.fi.muni.cz/usr/kretinsky/projects/GACR201970456.html
Cooperating Organization
Technical University Ostrava
  • Responsible person prof. RNDr. Petr Jančar, CSc.

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

Publications

Total number of publications: 28

1999

1998

Previous 1 2 3 Next

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