Publication result detail

Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems

HOLÍK, L.; ROGALEWICZ, A.; VOJNAR, T.; IOSIF, R.

Original Title

Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems

English Title

Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems

Type

WoS Article

Original Abstract

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.

English abstract

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.

Keywords

Generic register automata, Data automata, Trace inclusion,
Antichains, Interpolation, CEGAR, Simulation relations

Key words in English

Generic register automata, Data automata, Trace inclusion,
Antichains, Interpolation, CEGAR, Simulation relations

Authors

HOLÍK, L.; ROGALEWICZ, A.; VOJNAR, T.; IOSIF, R.

RIV year

2021

Released

08.07.2020

ISBN

0925-9856

Periodical

FORMAL METHODS IN SYSTEM DESIGN

Volume

55

Number

3

State

United States of America

Pages from

137

Pages to

170

Pages count

34

URL

https://link.springer.com/article/10.1007/s10703-020-00345-1

BibTex

@article{BUT170106,
  author="Lukáš {Holík} and Adam {Rogalewicz} and Tomáš {Vojnar} and Iosif {Radu}",
  title="Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems",
  journal="FORMAL METHODS IN SYSTEM DESIGN",
  year="2020",
  volume="55",
  number="3",
  pages="137--170",
  doi="10.1007/s10703-020-00345-1",
  issn="0925-9856",
  url="https://link.springer.com/article/10.1007/s10703-020-00345-1"
}

Documents

AbstractionRefinementAndAntich