Attributes | Values |
---|
rdf:type
| |
Description
| - Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We introduce a new general approach to regular model checking based on inference of regular languages. The method builds upon the observation that for infinite-state systems whose behaviour can be modelled using length-preserving transducers, there is a finite computation for obtaining all reachable configurations up to a certain length n.<br> These configurations are a (positive) sample of the reachable configurations of the given system, whereas~all other words up to length n are a negative sample. Then, methods of inference of regular languages can be used to generalise the sample to the full reachability set (or an overapproximation of it). We have implemented our method in a prototype tool which shows that our approach is competitive on a number of concrete examp
- Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We introduce a new general approach to regular model checking based on inference of regular languages. The method builds upon the observation that for infinite-state systems whose behaviour can be modelled using length-preserving transducers, there is a finite computation for obtaining all reachable configurations up to a certain length n.<br> These configurations are a (positive) sample of the reachable configurations of the given system, whereas~all other words up to length n are a negative sample. Then, methods of inference of regular languages can be used to generalise the sample to the full reachability set (or an overapproximation of it). We have implemented our method in a prototype tool which shows that our approach is competitive on a number of concrete examp (en)
- článek presentuje originální přístup k implemetaci regulárního model checkingu, což je generická metoda pro verifikaci nekonečně stavových a parametrických systémů. Navržená metoda je založena na učení regulárních jazyků ze vzorků. Metoda byla experimentálně ověřena a vykazuje velmi pěkné výkonnostní charakteristiky. Co je ale ještě více zajímavé, je to, že tato metoda zaručuje konečnost výpočtu ve všech případech, kdy zkoumaný systém ma regulární stavový prostor. (cs)
|
Title
| - Regular Model Checking Using Inference of Regular Languages
- Regular Model Checking Using Inference of Regular Languages (en)
- Regulární model checking založený na učení jazyků (cs)
|
skos:prefLabel
| - Regular Model Checking Using Inference of Regular Languages
- Regular Model Checking Using Inference of Regular Languages (en)
- Regulární model checking založený na učení jazyků (cs)
|
skos:notation
| - RIV/00216305:26230/05:PU66853!RIV07-GA0-26230___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GA102/04/0780), P(GP102/03/D211)
|
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26230/05:PU66853
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - formal verification, model checking, parametric systems, infinite-state systems, automata theory, inference of regular languages (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| - US - Spojené státy americké
|
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| - ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| - Vojnar, Tomáš
- Habermehl, Peter
|
issn
| |
number of pages
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |