Result Details
Symbolic Data Structures for Parametric Verification
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.
parametric verification, symbolic data structures, formal methods
@misc{BUT66771,
author="Petr {Matoušek}",
title="Symbolic Data Structures for Parametric Verification",
year="2005",
pages="106",
publisher="Faculty of Information Technology BUT",
address="Brno",
url="https://www.fit.vut.cz/research/publication/7945/"
}
Optická síť národního výzkumu a její nové aplikace, MŠMT, Výzkumná centra (2000-2004), MSM6383917201, start: 2004-01-01, end: 2010-12-31, completed
Výzkumná skupina automatizované analýzy a verifikace - VeriFIT (RG VERIFIT)