@inproceedings{e03c0ac1b12549ecb1a0056ff8d9d4c5,

title = "Deadlock Checking for Complete Finite Prefixes Using Logic Programs with Stable Model Semantics",

keywords = "deadlocks, logic programming, net unfoldings, petri nets, prefixes, verification, deadlocks, logic programming, net unfoldings, petri nets, prefixes, verification, deadlocks, logic programming, net unfoldings, petri nets, prefixes, verification",

author = "K. Heljanko",

note = "VK: sa-in-98-01",

year = "1998",

language = "English",

pages = "106--115",

editor = "H.-D. Burkhard and L. Czaja and P. Starke",

booktitle = "Workshop Concurrency, Specification & Programming 1998",

publisher = "Humboldt University of Berlin",

address = "Germany",

}