@book{9a1a0900295d40eca57c32b1ed70d5c3,
title = "Deadlock and Reachability Checking with Finite Complete Prefixes",
keywords = "computational complexity, deadlocks, logic programs, Petri nets, reachability, unfoldings, verification, computational complexity, deadlocks, logic programs, Petri nets, reachability, unfoldings, verification, computational complexity, deadlocks, logic programs, Petri nets, reachability, unfoldings, verification",
author = "K. Heljanko",
year = "1999",
language = "English",
}