Reference:
Marko Mäkelä. Condensed storage of multi-set sequences. In Kurt Jensen, editor, Practical Use of High-Level Petri Nets, number 547 in DAIMI report PB, pages 111–125. University of Århus, Denmark, June 2000.
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.
Keywords:
Petri nets, reachability analysis, encoding multi-sets, ordered data types
Suggested BibTeX entry:
@inproceedings{MakelaMarko-Makela:multiset,
author = {Marko M{\"a}kel{\"a}},
booktitle = {Practical Use of High-Level Petri Nets},
editor = {Jensen, Kurt},
month = {June},
number = {547},
organization = {University of {\AA{}}rhus, Denmark},
pages = {111--125},
series = {DAIMI report PB},
title = {Condensed storage of multi-set sequences},
year = {2000},
}
|