Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F20%3APU139892" target="_blank" >RIV/00216305:26230/20:PU139892 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/article/10.1007/s10703-020-00345-1" target="_blank" >https://link.springer.com/article/10.1007/s10703-020-00345-1</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10703-020-00345-1" target="_blank" >10.1007/s10703-020-00345-1</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems

Popis výsledku v původním jazyce

A generic register automaton is a finite automaton equipped with variables (which may be viewed as counters or, more generally, registers) ranging over infinite data domains. A trace of a generic register automaton is an alternating sequence of alphabet symbols and values taken by the variables during an execution of the automaton. The problem addressed in this paper is the inclusion between the sets of traces (data languages) recognized by such automata. Since the problem is undecidable in general, we give a semi-algorithm based on a~combination of abstraction refinement and antichains, which is proved to be sound and complete, but whose termination is not guaranteed. Moreover, we further enhance the proposed algorithm by exploiting a concept of data simulations, i.e., simulation relations aware of the data associated with the words. We have implemented our technique in a prototype tool and show promising results on multiple non-trivial examples.

Název v anglickém jazyce

Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems

Popis výsledku anglicky

A generic register automaton is a finite automaton equipped with variables (which may be viewed as counters or, more generally, registers) ranging over infinite data domains. A trace of a generic register automaton is an alternating sequence of alphabet symbols and values taken by the variables during an execution of the automaton. The problem addressed in this paper is the inclusion between the sets of traces (data languages) recognized by such automata. Since the problem is undecidable in general, we give a semi-algorithm based on a~combination of abstraction refinement and antichains, which is proved to be sound and complete, but whose termination is not guaranteed. Moreover, we further enhance the proposed algorithm by exploiting a concept of data simulations, i.e., simulation relations aware of the data associated with the words. We have implemented our technique in a prototype tool and show promising results on multiple non-trivial examples.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

FORMAL METHODS IN SYSTEM DESIGN

ISSN

0925-9856

e-ISSN

1572-8102

Svazek periodika

55

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

34

Strana od-do

137-170

Kód UT WoS článku

000546198700001

EID výsledku v databázi Scopus

2-s2.0-85087658314