Coping With Strong Fairness – On-the-fly Emptiness Checking for Streett Automata

Reference:

Timo Latvala and Keijo Heljanko. Coping with strong fairness – on-the-fly emptiness checking for Streett automata. In H.-D. Burkhard, L. Czaja, H.-S. Nguyen, and P. Starke, editors, Proceedings of the Workshop Concurrency, Specification & Programming 1999, pages 107–118, Warsaw, Poland, September 1999. Warsaw University.

Keywords:

verification, model checking, fairness, Streett automata, counterexamples

Suggested BibTeX entry:

@inproceedings{LatHel:CSP99,
    address = {Warsaw, Poland},
    author = {Timo Latvala and Keijo Heljanko},
    booktitle = {Proceedings of the Workshop Concurrency, Specification \& Programming 1999},
    editor = {H.-D. Burkhard and L. Czaja and H.-S. Nguyen and P. Starke},
    month = {September},
    pages = {107--118},
    publisher = {Warsaw University},
    title = {Coping With Strong Fairness -- On-the-fly Emptiness Checking for {S}treett Automata},
    year = {1999},
}