%0 Conference Proceedings
%T Correct and Efficient Antichain Algorithms for Refinement Checking
%+ Eindhoven University of Technology [Eindhoven] (TU/e)
%A Laveaux, Maurice
%A Groote, Jan, Friso
%A Willemse, Tim
%Z Part 1: Full Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 39th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Copenhagen, Denmark
%Y Jorge A. Pérez
%Y Nobuko Yoshida
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-11535
%P 185-203
%8 2019-06-17
%D 2019
%R 10.1007/978-3-030-21759-4_11
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Refinement checking plays an important role in system verification. This means that the correctness of the system is established by showing a refinement relation between two models; one for the implementation and one for the specification. In [21], Wang et al. describe an algorithm based on antichains for efficiently deciding stable failures refinement and failures-divergences refinement. We identify several issues pertaining to the correctness and performance in these algorithms and propose new, correct, antichain-based algorithms. Using a number of experiments we show that our algorithms outperform the original ones in terms of running time and memory usage.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-02313731/document
%2 https://inria.hal.science/hal-02313731/file/478668_1_En_11_Chapter.pdf
%L hal-02313731
%U https://inria.hal.science/hal-02313731
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-11535