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%2F16%3APU121584" target="_blank" >RIV/00216305:26230/16:PU121584 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007/978-3-662-49674-9_5" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-662-49674-9_5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-49674-9_5" target="_blank" >10.1007/978-3-662-49674-9_5</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 data automaton is a finite automaton equipped with variables (counters or registers) ranging over infinite data domains. A trace of a data automaton is an alternating sequence of alphabet symbols and values taken by the counters 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, we give a semi-algorithm based on abstraction refinement, which is proved to be sound and complete, but whose termination is not guaranteed. We have implemented our technique in a prototype tool and show promising results on several non-trivial examples.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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
2016
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
Article name in the collection
Tools and Algorithms for the Construction and Analysis of Systems
ISBN
978-3-662-49673-2
ISSN
—
e-ISSN
—
Number of pages
19
Pages from-to
71-89
Publisher name
Springer Verlag
Place of publication
Heidelberg
Event location
Eindhoven
Event date
Apr 2, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000406428000005