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

Project information
Infinite state concurrent systems - models and verification

Information

This project doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official project website can be found on muni.cz.
Investor logo
Project Identification
GA201/00/0400
Project Period
1/2000 - 12/2002
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/GACR201000400.html
Cooperating Organization
Technical University Ostrava
  • Responsible person prof. RNDr. Petr Jančar, CSc.

This project proposal is motivated by one of the concurrent research trends in concurrency theory, e.i. by modelling, analysis and verification of concurrent infinite state systems. Verification is understood as (an examination of possibly algorithmic) c hecking 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 Petri nets ; 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, to describe their relati onships, to study regularity conditions, and to examine the possibilities of their so called characterisations w.r.t. relevant preorders. Also it is suggested to study decidability issues of modal a temporal logics (or their reasonable fragments) for the

Publications

Total number of publications: 36

2002

2001

Previous 1 2 3 4 Next

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

More info