New Search Strategies for the Petri Net CEGAR Approach
Petri nets are a successful formal method for the modeling and verification of asynchronous, concurrent and distributed systems. Reachability analysis can provide important information about the behavior of the model. However, reachability analysis is a computationally hard problem, especially when the state space is infinite. Abstraction-based techniques are often applied to overcome complexity. In this paper we analyze an algorithm, which uses counterexample guided abstraction refinement. This algorithm proved its efficiency on the model checking contest. We examine the algorithm from a theoretical and practical point of view. On the theoretical side, we show that the algorithm cannot decide reachability for relatively simple instances. We propose a new iteration strategy to explore the invariant space, which extends the set of decidable problems. We also give proofs on the theoretical limits of our approach. On the practical side, we examine different search strategies and we present our new, complex strategy with superior performance compared to traditional strategies. Measurements show that our new contributions perform well for traditional benchmark models as well.
KeywordsPetri nets Reachability analysis Abstraction CEGAR ILP
Unable to display preview. Download preview PDF.
- 9.John, A., Konnov, I., Schmid, U., Veith, H., Widder, J.: Parameterized model checking of fault-tolerant distributed algorithms by abstraction. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 201–209, October 2013Google Scholar
- 10.Kordon, F., Linard, A., Becutti, M., Buchs, D., Fronc, L., Hulin-Hubard, F., Legond-Aubry, F., Lohmann, N., Marechal, A., Paviot-Adet, E., Pommereau, F., Rodrígues, C., Rohr, C., Thierry-Mieg, Y., Wimmel, H., Wolf, K.: Web report on the model checking contest @ Petri net 2013, June 2013. http://mcc.lip6.fr
- 11.Lipton, R.: The Reachability Problem Requires Exponential Space. Research report, Yale University, Dept. of Computer Science (1976)Google Scholar
- 12.Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pp. 238–246. STOC 1981. ACM, New York (1981)Google Scholar
- 14.Vörös, A., Darvas, D., Bartha, T.: Bounded saturation based CTL model checking. In: Proceedings of the 12th Symposium on Programming Languages and Software Tools, SPLST 2011 (2011)Google Scholar
- 15.Website of PetriDotNet. http://inf.mit.bme.hu/en/research/tools/petridotnet (online accessed March 22, 2015)
- 16.Website of the models used in the measurements. http://inf.mit.bme.hu/en/pn2015 (online accessed March 22, 2015)
- 17.Website of the SARA tool. http://www.service-technology.org/sara/index.html (online accessed March 22, 2015)
- 19.Wimmel, H., Wolf, K.: Applying CEGAR to the Petri net state equation. Logical Methods in Computer Science 8(3) (2012)Google Scholar