@inproceedings{
    Makela:multiset,
    editor = "Jensen, Kurt",
    author = {M{\"a}kel{\"a}, Marko},
    title = "Condensed storage of multi-set sequences",
    series = "DAIMI report PB",
    booktitle = "Practical Use of High-Level Petri Nets",
    number = "547",
    abstract = "Tools for state space exploration, or reachability analysers, work by incrementally constructing a set of reachable states. The applicability of these tools is limited by the vast state space of real systems. One way to attack this problem are different reduction methods - another approach is to come up with techniques for representing the set of reachable states in a compact way. The state - or marking - of a high-level Petri net can be viewed as a sequence of finite multi-sets. A method for encoding markings containing structured values is described, and a comparison to an earlier implementation is presented.",
    month = "June",
    flags = "public",
    year = "2000",
    keywords = "Petri nets, reachability analysis, encoding multi-sets, ordered data types",
    organization = "University of {\AA{}}rhus, Denmark",
    pdf = "multiset.pdf",
    pages = "111--125"
}