Model Checking with Finite Complete Prefixes is PSPACE-Complete

K. Heljanko

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

    2 Citations (Scopus)
    Original languageEnglish
    Title of host publicationThe 11th International Conference on Concurrency Theory, CONCUR 2000, University Park PA, USA, August 2000
    EditorsC. Palamidessi
    Place of PublicationBerlin, Germany
    Pages108-122
    Publication statusPublished - 2000
    MoE publication typeA4 Article in a conference publication

    Keywords

    • net unfoldings
    • PSPACE-completeness
    • temporal logics

    Cite this