Possibilistic WorkFlow Nets for Dealing with Cancellation Regions in Business Processes

Leiliane Pereira de Rezende, Stéphane Julia, Janette Cardoso

2016

Abstract

In this paper, an approach based on WorkFlow nets and possibilistic Petri nets is proposed for dealing with the cancellation features in business processes. Routing patterns existing in business processes are modeled by WorkFlow nets. Possibilistic Petri nets with uncertainty in the marking and the transition firing are used to deal with all possible markings when cancellation behaviour is considered. Combining both formalisms, a kind of possibilistic WorkFlow net is obtained. An example of a simplified version of a credit card application process is presented.

References

  1. Araki, T. and Kasami, T. (1976). Some decision problems related to the reachability problem for petri nets. Theoretical Computer Science, 3:85 - 104.
  2. Beaudouin-Lafon, M., Mackay, W., Jensen, M., Andersen, P., Janecek, P., Lassen, M., Lund, K., Mortensen, K., Munck, S., Ratzer, A., Ravn, K., Christensen, S., and Jensen, K. (2001). Cpn/tools: A tool for editing and simulating coloured petri nets etaps tool demonstration related to tacas. In Tools and Algorithms for the Construction and Analysis of Systems, volume 2031, pages 574-577. Springer Berlin Heidelberg.
  3. Cardoso, J. (1999). Time fuzzy petri nets. In Fuzziness in Petri Nets, pages 115 - 145. Springer.
  4. Cardoso, J., Valette, R., and Dubois, D. (1989). Petri nets with uncertain markings. In Applications and Theory of Petri Nets, volume 483, pages 64 - 78.
  5. Dufourd, C., Finkel, A., and Schnoebelen, P. (1998). Reset nets between decidability and undecidability. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming, volume 1443, pages 103-115.
  6. Dufourd, C., Janc?ar, P., and Schnoebelen, P. (1999). Boundedness of reset p/t nets. In International Colloquium on Automata, Languages and Programming, volume 1644, pages 301-310.
  7. Hofstede, A. H. M. t., van der Aalst, W. M. P., Adams, M., and Russell, N., editors (2010). Modern Business Process Automation - YAWL and its Support Environment. Springer Science & Business Media.
  8. Members, W. M. C. (1994). Glossary - a workflow management coalition specification. Technical report, Coalition, Workflow Management.
  9. Sibertin-Blanc, C. (2001). Cooperative objects: Principles, use and implementation. In Concurrent ObjectOriented Programming and Petri Nets, volume 2001, pages 216-246.
  10. Soares Passos, L. and Julia, S. (2009). Qualitative analysis of workflow nets using linear logic: Soundness verification. In Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on, pages 2843 -2847.
  11. van der Aalst, W. M. P. (1998). The application of petri nets to workflow management. Journal of Circuits Systems and Computers, 8:21-66.
  12. van der Aalst, W. M. P. (2000). Workflow verification: Finding control-flow errors using petri-net-based techniques. In Business Process Management, Models, Techniques, and Empirical Studies, pages 161-183.
  13. van der Aalst, W. M. P., Hofstede, A. H. M. t., Kiepuszewski, B., and Barros, A. P. (2003). Workflow patterns. Distrib. Parallel Databases, 14:5-51.
  14. van der Aalst, W. M. P. and van Hee, K. (2004). Workflow Management: Models, Methods, and Systems. MIT Press.
  15. van der Aalst, W. M. P., van Hee, K., Hofstede, A. H. M. t., Sidorova, N., Verbeek, H., Voorhoeve, M., and Wynn, M. (2009). Soundness of workflow nets with reset arcs. In Transactions on Petri Nets and Other Models of Concurrency III, volume 5800, pages 50-70.
  16. van der Aalst, W. M. P., van Hee, K. M., Hofstede, A. H. M. t., Sidorova, N., Verbeek, H. M. W., Voorhoeve, M., and Wynn, M. T. (2011). Soundness of workflow nets: Classification, decidability, and analysis. Form. Asp. Comput., 23:333-363.
  17. Verbeek, H., van der Aalst, W. M. P., and Hofstede, A. H. M. t. (2007). Verifying workflows with cancellation regions and or-joins: An approach based on relaxed soundness and invariants. The Computer Journal, 50:294-314.
  18. Verbeek, H., Wynn, M., van der Aalst, W. M. P., and Hofstede, A. H. M. t. (2010). Reduction rules for reset/inhibitor nets. Journal of Computer and System Sciences, 76:125 - 143.
  19. Wang, J., Tepfenhart, W. M., and Rosca, D. (2009). Emergency response workflow resource requirements modeling and analysis. IEEE Transactions on SMC, Part C, 39:270-283.
  20. Wynn, M., Verbeek, H., van der Aalst, W. M. P., Hofstede, A. H. M. t., and Edmond, D. (2009). Soundnesspreserving reduction rules for reset workflow nets. Information Sciences, 179:769-790.
  21. Wynn, M. T. K. (2006). Semantics, Verification, and Implementation of Workflows with Cancellation Regions and OR-joins. PhD thesis, Queensland University of Technology.
Download


Paper Citation


in Harvard Style

Rezende L., Julia S. and Cardoso J. (2016). Possibilistic WorkFlow Nets for Dealing with Cancellation Regions in Business Processes . In Proceedings of the 18th International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-758-187-8, pages 126-133. DOI: 10.5220/0005760301260133


in Bibtex Style

@conference{iceis16,
author={Leiliane Pereira de Rezende and Stéphane Julia and Janette Cardoso},
title={Possibilistic WorkFlow Nets for Dealing with Cancellation Regions in Business Processes},
booktitle={Proceedings of the 18th International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2016},
pages={126-133},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005760301260133},
isbn={978-989-758-187-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 18th International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - Possibilistic WorkFlow Nets for Dealing with Cancellation Regions in Business Processes
SN - 978-989-758-187-8
AU - Rezende L.
AU - Julia S.
AU - Cardoso J.
PY - 2016
SP - 126
EP - 133
DO - 10.5220/0005760301260133