Coping with strong fairness - on-the-fly emptiness checking with Streett Automata

T. Latvala, K. Heljanko

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Original languageEnglish
    Title of host publicationConcurrency, Specification & Programming'99 (CS&P'99), Varsova, Puola, 28.-30.9.1999
    EditorsH-D. Burkhard, L. Czaja, H-S. Nguyen, P. Starke
    Place of PublicationVarsova
    PublisherWarsaw University
    Pages107-118
    Publication statusPublished - 1999
    MoE publication typeA4 Article in a conference publication

    Keywords

    • counterexamples
    • fairness
    • model checking
    • Streett automata
    • verification

    Cite this

    Latvala, T., & Heljanko, K. (1999). Coping with strong fairness - on-the-fly emptiness checking with Streett Automata. In H-D. Burkhard, L. Czaja, H-S. Nguyen, & P. Starke (Eds.), Concurrency, Specification & Programming'99 (CS&P'99), Varsova, Puola, 28.-30.9.1999 (pp. 107-118). Warsaw University.