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, Concurrency, Specification & Programming Workshop, pages 107–118, Warsaw, Poland, September 1999. Institute of Informatics, Warsaw University.

Suggested BibTeX entry:

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