Modeling and Verification of a Protocol for Operational Support Using Coloured Petri Nets

  • Michael Westergaard
  • Fabrizio M. Maggi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6709)


In this paper, we describe the modeling and analysis of a protocol for operational support during workflow enactment. Operational support provides online replies to questions such as “is my execution valid?” and “how do I end the execution in the fastest/cheapest way?”, and may be invoked multiple times for each execution.

Multiple applications (operational support providers) may be able to answer such questions, so a protocol supporting this should be able to handle multiple providers, maintain data between queries about the same execution, and discard information when it is no longer needed.

We present a coloured Petri net model of a protocol satisfying our requirements. The model is used both to make our requirements clear by building a model-based prototype before implementation and to verify that the devised protocol is correct.

We present techniques to make analysis of the large state-space of the model possible, including modeling techniques and an improved state representation for coloured Petri nets allowing explicit representation of state spaces with more than 108 states on a normal PC.

We briefly describe our implementation in the process mining tool ProM and how we have used it to improve an existing provider.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bryant, R.E.: Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)CrossRefzbMATHGoogle Scholar
  2. 2.
    Christensen, S., Kristensen, L.M.: State Space Analysis of Hierarchical Coloured Petri Nets. Petri Net Approaches for Modelling and Validation, 1–16 (2003)Google Scholar
  3. 3.
    CPN Tools webpage,
  4. 4.
    Evangelista, S., Westergaard, M., Kristensen, L.M.: The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection. ToPNoC 3, 189–215 (2009)zbMATHGoogle Scholar
  5. 5.
    Holzmann, G.J.: An Analysis of Bitstate Hashing. FMSD 13, 289–307 (1998)Google Scholar
  6. 6.
    Jensen, K., Kristensen, L.M.: Coloured Petri Nets – Modelling and Validation of Concurrent Systems. Springer, Heidelberg (2009)CrossRefzbMATHGoogle Scholar
  7. 7.
    Mailund, T., Westergaard, M.: Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 177–191. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Pesic, M., Schonenberg, H., van der Aalst, W.M.P.: DECLARE: Full Support for Loosely-Structured Processes. In: Proc. of EDOC 2007, p. 287 (2007)Google Scholar
  9. 9.
    Process mining webpage,
  10. 10.
    Rozinat, A., Wynn, M.T., van der Aalst, W.M.P., ter Hofstede, A.H.M., Fidge, C.J.: Workflow Simulation for Operational Decision Support. Data Knowl. Eng. 68, 834–850 (2009)CrossRefGoogle Scholar
  11. 11.
    Westergaard, M., Evangelista, S., Kristensen, L.M.: ASAP: An Extensible Platform for State Space Analysis. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, Springer, Heidelberg (2009)Google Scholar
  12. 12.
    Westergaard, M., Kristensen, L.M.: The Access/CPN Framework: A Tool for Interacting With the CPN Tools Simulator. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, Springer, Heidelberg (2009)Google Scholar
  13. 13.
    Wolper, P., Leroy, D.: Reliable Hashing without Collision Detection. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 59–70. Springer, Heidelberg (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael Westergaard
    • 1
  • Fabrizio M. Maggi
    • 1
  1. 1.Department of Mathematics and Computer ScienceEindhoven University of TechnologyThe Netherlands

Personalised recommendations