2000 character limit reached
Reachability via Compositionality in Petri nets
Published 6 Mar 2013 in cs.LO | (1303.1399v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.