Verification of Petri Nets with Read Arcs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Verification of Petri Nets with Read Arcs


Recent work studied the unfolding construction for contextual nets, i.e. nets with read arcs. Such unfoldings are more concise and can usually be constructed more efficiently than for Petri nets. However, concrete verification algorithms exploiting these advantages were lacking so far. We address this question and propose SAT-based verification algorithms for deadlock and reachability of contextual nets. Moreover, we study optimizations of the SAT encoding and report on experiments.


Other [cs.OH]

Dates and versions

hal-00776598 , version 1 (15-01-2013)



César Rodríguez, Stefan Schwoon. Verification of Petri Nets with Read Arcs. Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), 2012, Newcastle, United Kingdom. pp.471-485, ⟨10.1007/978-3-642-32940-1_33⟩. ⟨hal-00776598⟩
63 View
0 Download



Gmail Facebook X LinkedIn More