Reachability via Compositionality in Petri nets
classification
💻 cs.LO
keywords
netspetrireachabilitytechniquealgebracheckingcompositionalcompositionality
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.