SAT-Solving the Coverability Problem for Petri Nets

  • Authors:

  • Parosh Aziz Abdulla;S. Purushothaman Iyer;Aletta Nylén

  • Affiliations:

  • Department of Information Technology, Uppsala University, P.O. Box 337, S-751 05 Uppsala, Sweden. parosh@it.uu.se;Department of Computer Science, NC State University, Raleigh, NC 27695-7534, USA. purush@csc.ncsu.edu;Department of Information Technology, Uppsala University, P.O. Box 337, S-751 05 Uppsala, Sweden. aletta@it.uu.se

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Net unfoldings have attracted great attention as a powerful technique for combating state space explosion in model checking, and have been applied to verification of finite state systems including 1-safe (finite) Petri nets and synchronous products of finite transition systems. Given that net unfoldings represent the state space in a distributed, implicit manner the verification algorithm is necessarily a two step process: generation of the unfolding and reasoning about it. In his seminal work McMillan (K.L. McMillan, Symbolic Model Checking. Kluwer Academic Publishers, 1993) showed that deadlock detection on unfoldings of 1-safe Petri nets is NP-complete. Since the deadlock problem on Petri nets is PSPACE-hard it is generally accepted that the two step process will yield savings (in time and space) provided the unfoldings are small.In this paper we show how unfoldings can be extended to the context of infinite-state systems. More precisely, we show how unfoldings can be constructed to represent sets of backward reachable states of unbounded Petri nets in a symbolic fashion. Furthermore, based on unfoldings, we show how to solve the coverability problem for unbounded Petri nets using a SAT-solver. Our experiments show that the use of unfoldings, in spite of the two-step process for solving coverability, has better time and space characteristics compared to a traditional reachability based implementation that considers all interleavings for solving the coverability problem.