Publication detail

Symbolic Data Structures for Parametric Verification

MATOUŠEK, P.

Original Title

Symbolic Data Structures for Parametric Verification

Type

dissertation

Language

English

Original Abstract

Analysis of parametric systems mostly depend on the efficient data structure that is used to express behaviour of the system. In this work we introduce a new data structure called parameterized hypercubes based on intevals with parameters, and operations needed for verification. This structure makes operations over parametric counter automata simpler in comparison with other approaches (parametric DBMs) and it extends expressivity of constrains on transitions.

We discuss here fundamentals of modelling, analysis, and verification of parameterized systems. We introduce a methodology for modelling communicating systems that include three basic components - environment, buffers and executive units.

Keywords

parametric verification, symbolic data structures, formal methods

Authors

MATOUŠEK, P.

Released

18. 10. 2005

Location

Brno

Pages count

99

URL

BibTex

@phdthesis{BUT66771,
  author="Petr {Matoušek}",
  title="Symbolic Data Structures for Parametric Verification",
  address="Brno",
  pages="99",
  year="2005",
  url="http://www.fit.vutbr.cz/~matousp/doc/2005/dis2.pdf"
}