Properties of State Spaces

Radek Pelanek
xpelanek@fi.muni.cz
ParaDiSe, Faculty of Informatics
Masaryk University Brno

Project description

Goal: To answer the following questions:

What do have state spaces in common? What are their typical properties? Can state spaces be modeled by random graphs or by some class of regular graphs in a satisfactory manner? Can we exploit these typical properties to traverse or model check a state space more efficiently? Or at least to better analyze complexity of algorithms? Can some information about a state space be of any use to the user or to the developer of a model checker? Is there any significant difference between toy academical models and real life case studies? Are state spaces similar to such an extent that it does not matter which models we choose for benchmarking our algorithms?

Methodology:
  1. Collect large number of state spaces generated from different tools and models from many different people.
  2. Measure parameters of collected state spaces, compute statistics.
  3. Try to answer the questions.
Aims of these web-pages:

Results

Related projects