On the Computation of Stubborn Sets of Colored Petri Nets

  • Sami Evangelista
  • Jean-François Pradat-Peyre
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4024)


Valmari’s Stubborn Sets method is a member of the so-called partial order methods. These techniques are usually based on a selective search algorithm: at each state processed during the search, a stubborn set is calculated and only the enabled transitions of this set are used to generate the successors of the state. The computation of stubborn sets requires to detect dependencies between transitions in terms of conflict and causality. In colored Petri nets these dependencies are difficult to detect because of the color mappings present on the arcs: conflicts and causality connections depend on the structure of the net but also on these mappings. Thus, tools that implement this technique usually unfold the net before exploring the state space, an operation that is often untractable in practice. We present in this work an alternative method which avoids the cost of unfolding the net. To allow this, we use a syntactically restricted class of colored nets. Note that this class still enables wide modeling facilities since it is the one used in our model checker Helena which has been designed to support the verification of software specifications. The algorithm presented has been implemented and several experiments which show the benefits of our approach are reported. For several models we obtain a reduction close or even equal to the one obtained after an unfolding of the net. We were also able to efficiently reduce the state spaces of several models obtained by an automatic translation of concurrent software.


Model Check Color Mapping Concurrent Program Reachability Graph Reverse Operation 
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.
    Brgan, R., Poitrenaud, D.: An efficient algorithm for the computation of stubborn sets of well formed petri nets. In: DeMichelis, G., Díaz, M. (eds.) ICATPN 1995. LNCS, vol. 935, pp. 121–140. Springer, Heidelberg (1995)Google Scholar
  2. 2.
    Capra, L., Franceschinis, G., De Pierro, M.: A high level language for structural relations in well-formed nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 168–187. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: On well-formed coloured nets and their symbolic reachability graph. In: Application and Theory of Petri Nets, pp. 373–396. Springer, Heidelberg (1990)Google Scholar
  4. 4.
    Chiola, G., Franceschinis, G., Gaeta, R.: A symbolic simulation mechanism for well-formed coloured petri nets. In: Simulation Symposium (1992)Google Scholar
  5. 5.
    Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)Google Scholar
  6. 6.
    Dutheillet, C., Haddad, S.: Structural analysis of coloured nets. application to the detection of confusion. Technical Report 16, IBP/MASI (1992)Google Scholar
  7. 7.
    Evangelista, S.: High level petri nets analysis with Helena. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 455–464. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Evangelista, S., Haddad, S., Pradat-Peyre, J.-F.: Syntactical colored petri nets reductions. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 202–216. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Evangelista, S., Kaiser, C., Pajault, C., Pradat-Peyre, J.-F., Rousseau, P.: Dynamic tasks verification with Quasar. In: Vardanega, T., Wellings, A.J. (eds.) Reliable Software Technology – Ada-Europe 2005. LNCS, vol. 3555, pp. 91–104. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Holzmann, G.J., Peled, D.: An improvement in formal verification. In: Formal Description Techniques, pp. 197–211 (1994)Google Scholar
  11. 11.
    Jensen, K.: Coloured petri nets: A high level language for system design and analysis. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483. Springer, Heidelberg (1991)Google Scholar
  12. 12.
    Jørgensen, J.B., Kristensen, L.M.: Computer aided verification of lamport’s fast mutual exclusion algorithm using colored petri nets and occurrence graphs with symmetries. IEEE Transactions on Parallel and Distributed Systems 10(7) (1999)Google Scholar
  13. 13.
    Kristensen, L.M., Valmari, A.: Finding stubborn sets of coloured petri nets without unfolding. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol. 1420, pp. 104–123. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  14. 14.
    Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 409–423. Springer, Heidelberg (1993)Google Scholar
  15. 15.
    Poitrenaud, D., Pradat-Peyre, J.-F.: Pre- and post-agglomerations for LTL model checking. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 387–408. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  16. 16.
    Valmari, A.: Error detection by reduced reachability graph generation. In: Rozenberg, G. (ed.) APN 1989. LNCS, vol. 424. Springer, Heidelberg (1990)Google Scholar
  17. 17.
    Valmari, A.: State Space Generation: Efficiency and Practicality. PhD thesis, Tampere University of Technology (1988)Google Scholar
  18. 18.
    Valmari, A.: Eliminating redundant interleavings during concurrent program verification. In: Odijk, E., Rem, M., Syre, J.-C. (eds.) PARLE 1989. LNCS, vol. 366, pp. 89–103. Springer, Heidelberg (1989)Google Scholar
  19. 19.
    Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 491–515. Springer, Heidelberg (1991)Google Scholar
  20. 20.
    Valmari, A.: Stubborn sets of coloured petri nets. In: Application and Theory of Petri Nets, pp. 102–121 (1991)Google Scholar
  21. 21.
    Varpaaniemi, K.: On choosing a scapegoat in the stubborn set method. In: Workshop on Concurrency, Specification & Programming, pp. 163–171 (1993)Google Scholar
  22. 22.
    Varpaaniemi, K.: On the Stubborn Set Method in Reduced State Space Generation. PhD thesis, Helsinki University of Technology (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sami Evangelista
    • 1
  • Jean-François Pradat-Peyre
    • 1
  1. 1.CEDRIC – CNAM ParisParis

Personalised recommendations