Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems

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.
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02388322
Contributor : Radu Iosif <>
Submitted on : Sunday, December 1, 2019 - 5:18:08 PM
Last modification on : Wednesday, December 4, 2019 - 1:05:26 AM

File

trace-inclusion-revisions-2.pd...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02388322, version 1

Collections

Citation

Lukáš Holík¨radu, Radu Iosif, A Rogalewicz, T Vojnar. Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. Formal Methods in System Design, Springer Verlag, In press. ⟨hal-02388322⟩

Share

Metrics

Record views

17

Files downloads

23