Construction and SAT-Based Verification of Contextual Unfoldings

  • Stefan Schwoon
  • César Rodríguez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)


Unfoldings succinctly represent the set of reachable markings of a Petri net. Here, we shall consider the case of contextual nets, which extend Petri nets with read arcs, and which are more suitable to represent the case of concurrent read access. We discuss the problem of (efficiently) constructing unfoldings of such nets. On the basis of these unfoldings, various verification problems can be encoded as satisfiability problems in propositional logic.


Propositional Logic Reachability Problem Reachable Marking Concurrent Constraint Concurrent Constraint Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baldan, P., Bruni, A., Corradini, A., König, B., Schwoon, S.: On the computation of mcMillan”s prefix for contextual nets and graph grammars. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 91–106. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    Baldan, P., Corradini, A., König, B., Schwoon, S.: McMillan’s complete prefix for contextual nets. In: Jensen, K., van der Aalst, W.M.P., Billington, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency I. LNCS, vol. 5100, pp. 199–220. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2008)zbMATHGoogle Scholar
  4. 4.
    Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. Formal Methods in System Design 20, 285–310 (2002)CrossRefzbMATHGoogle Scholar
  5. 5.
    Heljanko, K.: Combining Symbolic and Partial-Order Methods for Model-Checking 1-Safe Petri Nets. Ph.D. thesis. Helsinki University of Technology (2002)Google Scholar
  6. 6.
    Janicki, R., Koutny, M.: Invariant semantics of nets with inhibitor arcs. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 317–331. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  7. 7.
    McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 164–177. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  8. 8.
    Montanari, U., Rossi, F.: Contextual occurrence nets and concurrent constraint programming. In: Ehrig, H., Schneider, H.-J. (eds.) Dagstuhl Seminar 1993. LNCS, vol. 776. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  9. 9.
    Ristori, G.: Modelling systems with shared resources via Petri nets. Ph.D. thesis. University of Pisa (1994)Google Scholar
  10. 10.
  11. 11.
    Rodríguez, C., Schwoon, S., Baldan, P.: Efficient contextual unfolding. Tech. rep., LSV, ENS de Cachan (2011)Google Scholar
  12. 12.
    Vogler, W., Semenov, A.L., Yakovlev, A.: Unfolding and finite prefix for nets with read arcs. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 501–516. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  13. 13.
    Winkowski, J.: Reachability in contextual nets. Fundamenta Informaticae 51(1-2), 235–250 (2002)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Stefan Schwoon
    • 1
  • César Rodríguez
    • 1
  1. 1.LSV, ENS de Cachan & CNRS, INRIACachanFrance

Personalised recommendations