McMillan's Complete Prefix for Contextual Nets

@article{Baldan2008McMillansCP,
  title={McMillan's Complete Prefix for Contextual Nets},
  author={Paolo Baldan and Andrea Corradini and Barbara K{\"o}nig and Stefan Schwoon},
  journal={Trans. Petri Nets and Other Models of Concurrency},
  year={2008},
  volume={1},
  pages={199-220}
}
This talk consists of two parts, respectively based on the papers, [4] and [5]. We first discuss branching processes and unfoldings of high-level Petri nets and outline an algorithm which builds finite and complete prefixes of such unfoldings. Its advantage is that it avoids a potentially expensive translation of a high-level Petri net into a low-level one. In the second part we present an application of such an approach to the verification of mobile systems.