@inproceedings{
    Heljanko:CSP99,
    editor = "Burkhard, H.-D. and Czaja, L. and Nguyen, H.-S. and Starke, P.",
    author = "Heljanko, Keijo",
    publisher = "Warsaw University",
    title = "Minimizing Finite Complete Prefixes",
    url = "http://users.ics.tkk.fi/kepa/publications/",
    booktitle = "Proceedings of the Workshop Concurrency, Specification & Programming 1999",
    year = "1999",
    abstract = {Finite complete prefixes are used as a verification method for Petri nets and other formalisms where a similar notion of partial order behavior can be applied. They were introduced by McMillan, who also gave an algorithm to generate a finite complete prefix from a system description given as a Petri net. Later Esparza, R{\"o}mer and Vogler improved McMillan's prefix generation algorithm, which could sometimes create exponentially larger prefixes than required. In this work we refine the approach of Esparza et.al. further, and define a refined cut-off criterion, which makes it sometimes possible to create much smaller finite complete prefixes. Experimental results from a prototype implementation, a prefix minimizer, are presented. The method can also be applied directly during prefix generation.},
    month = "September",
    juforank = "NA",
    flags = "SA-IN-98-01",
    address = "Warsaw, Poland",
    keywords = "Petri nets, unfoldings, finite complete prefixes",
    pages = "83--95"
}