Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
FORMAL METHODS IN SYSTEM DESIGN
ISSN
0925-9856
e-ISSN
1572-8102
Volume of the periodical
55
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
34
Pages from-to
137-170
UT code for WoS article
000546198700001
EID of the result in the Scopus database
2-s2.0-85087658314