Reachability via Compositionality in Petri nets
Logic in Computer Science
2014-04-22 v2
Abstract
We introduce a novel technique for checking reachability in Petri nets that relies on a recently introduced compositional algebra of nets. We prove that the technique is correct, and discuss our implementation. We report promising experimental results on some well-known examples.
Keywords
Cite
@article{arxiv.1303.1399,
title = {Reachability via Compositionality in Petri nets},
author = {Paweł Sobocinski and Owen Stephens},
journal= {arXiv preprint arXiv:1303.1399},
year = {2014}
}