Deadlock Checking for Complete Finite Prefixes Using Logic Programs with Stable Model Semantics

K. Heljanko

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

    Original languageEnglish
    Title of host publicationWorkshop Concurrency, Specification & Programming 1998
    EditorsH.-D. Burkhard, L. Czaja, P. Starke
    Place of PublicationBerlin
    PublisherHumboldt-Universität zu Berlin
    Pages106-115
    Publication statusPublished - 1998
    MoE publication typeA4 Article in a conference publication

    Keywords

    • deadlocks
    • logic programming
    • net unfoldings
    • petri nets
    • prefixes
    • verification

    Cite this