2013/03/06 by Paweł Sobociński, Sobocinski, Paweł, Owen Stephens +1
Business, Management and Accounting · Computer Science · #Business Process Modeling and Analysis #D.2.2 #F.1.1 #F.3.2 #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Petri Nets in System Modeling
paper · pdf · doi:10.48550/arxiv.1303.1399
openalex publication_date 2013/03/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.