Deadlock and Reachability Checking with Finite Complete Prefixes

K. Heljanko

    Research output: Working paperProfessional

    Original languageEnglish
    Place of PublicationEspoo
    Publication statusPublished - 1999
    MoE publication typeD4 Published development or research report or study

    Publication series

    NameHUT Laboratory for Theoretical Computer Science Research Reports
    PublisherHUT/Laboratory for Theoretical Computer Science
    No.HUT-TCS-A56

    Keywords

    • computational complexity
    • deadlocks
    • logic programs
    • Petri nets
    • reachability
    • unfoldings
    • verification

    Cite this

    Heljanko, K. (1999). Deadlock and Reachability Checking with Finite Complete Prefixes. (HUT Laboratory for Theoretical Computer Science Research Reports; No. HUT-TCS-A56).