Detail publikace

Advanced Ramsey-based Büchi Automata Inclusion Testing

ABDULLA, P. CHEN, Y. CLEMENTE, L. HOLÍK, L. HONG, C. MAYR, R. VOJNAR, T.

Originální název

Advanced Ramsey-based Büchi Automata Inclusion Testing

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

Checking language inclusion between two nondeterministic Büchi automata A and B is computationally hard (PSPACE-complete). However, several approaches which are efficient in many practical cases have been proposed. We build on one of these, which is known as the Ramsey-based approach. It has recently been shown that the basic Ramsey-based approach can be drastically optimized by using powerful subsumption techniques, which allow one to prune the search-space when looking for counterexamples to inclusion. While previous works only used subsumption based on set inclusion or forward simulation on A and B, we propose the following new techniques: (1) A larger subsumption relation based on a combination of backward and forward simulations on A and B. (2) A method to additionally use forward simulation between A and B. (3) Abstraction techniques that can speed up the computation and lead to early detection of counterexamples. The new algorithm was implemented and tested on automata derived from real-world model checking benchmarks, and on the Tabakov-Vardi random model, thus showing the usefulness of the proposed techniques.

Klíčová slova

Büchi automata, inclusion checking, Ramsey theorem, simulation relations

Autoři

ABDULLA, P.; CHEN, Y.; CLEMENTE, L.; HOLÍK, L.; HONG, C.; MAYR, R.; VOJNAR, T.

Rok RIV

2011

Vydáno

25. 7. 2011

ISSN

0302-9743

Periodikum

Lecture Notes in Computer Science

Ročník

2011

Číslo

6901

Stát

Spolková republika Německo

Strany od

187

Strany do

202

Strany počet

16

URL

http://www.springerlink.com/content/e14t15u580x7n332

BibTex

@article{BUT76413,
  author="Parosh {Abdulla} and Yu-Fang {Chen} and Lorenzo {Clemente} and Lukáš {Holík} and Chih-Duo {Hong} and Richard {Mayr} and Tomáš {Vojnar}",
  title="Advanced Ramsey-based Büchi Automata Inclusion Testing",
  journal="Lecture Notes in Computer Science",
  year="2011",
  volume="2011",
  number="6901",
  pages="187--202",
  issn="0302-9743",
  url="http://www.springerlink.com/content/e14t15u580x7n332"
}