Advertisement

Modeling Time-Critical Processes with WED-Flow

  • Rodrigo Alves Lima
  • Calton Pu
  • Bruno Padilha
  • Pedro L. Takecian
  • Leonardo T. Kamaura
  • João E. Ferreira
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10966)

Abstract

In this work, we show how time constraints can be specified with WED-flow – an alternative process modeling approach characterized as being transactional, event-based, and data-driven – and address the challenge of mapping processes modeled with WED-flow into colored Petri net structures. First, we show how time constraints can be specified with WED-flow. Although the correctness of so-called time-critical processes depends on the time their activities are performed, WED-flow has not been used for specifying time constraints up to now. As a concrete example, we specify a time constraint of SISAUT: a real-time system built using WED-flow techniques and tools that coordinates interacting parallel processes to collect and process materials from autopsies for research projects while questionnaires and consent forms are being filled out. We then address the challenge of mapping processes modeled with WED-flow into colored Petri net structures. We also show how to describe the temporal behavior of time-critical processes with time Petri nets. Therefore, we become able to reason about the functional (e.g., decide whether a certain state is definitely reached) and temporal (e.g., decide whether a deadline can be met) behaviors of instances of those processes through existing tools and methods of analysis. In SISAUT, for instance, timeliness is critical to success: the processing of collected materials must not take longer than 24 h from the declared time of death of the deceased. Up to now, the timeliness verification of SISAUT cases has been done manually, in an ad hoc manner. Thus, we present a method to automatically calculate the minimum time it takes to process the collected materials of a given SISAUT case through the analysis of an equivalent time colored Petri net.

References

  1. 1.
    van der Aalst, W.M.P.: Verification of workflow nets. In: Azéma, Pierre, Balbo, Gianfranco (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407–426. Springer, Heidelberg (1997).  https://doi.org/10.1007/3-540-63139-9_48CrossRefGoogle Scholar
  2. 2.
    Combi, C., Oliboni, B., Zerbato, F.: Modeling and handling duration constraints in BPMN 2.0. In: Proceedings of the Symposium on Applied Computing, pp. 727–734. ACM (2017)Google Scholar
  3. 3.
    Eder, J., Panagos, E., Rabinovich, M.: Time constraints in workflow systems. In: Jarke, M., Oberweis, A. (eds.) CAiSE 1999. LNCS, vol. 1626, pp. 286–300. Springer, Heidelberg (1999).  https://doi.org/10.1007/3-540-48738-7_22CrossRefGoogle Scholar
  4. 4.
    Ferreira, J.E., et al.: Dependency management with WED-flow techniques and tools: a case study. In: International Conference on Collaboration and Internet Computing. IEEE (2017)Google Scholar
  5. 5.
    Ferreira, J.E., et al.: Transactional recovery support for robust exception handling in business process services. In: International Conference on Web Services, pp. 303–310. IEEE (2012)Google Scholar
  6. 6.
    Jensen, K.: Coloured petri nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Central Models and Their Properties. LNCS, pp. 248–299. Springer, Heidelberg (1987).  https://doi.org/10.1007/BFb0046842CrossRefGoogle Scholar
  7. 7.
    Lanz, A., Weber, B., Reichert, M.: Time patterns for process-aware information systems. Requir. Eng. 19(2), 113–141 (2014)CrossRefGoogle Scholar
  8. 8.
    Liu, R., Kumar, A., Van Der Aalst, W.M.P.: A formal modeling approach for supply chain event management. Decis. Support Syst. 43(3), 761–778 (2007)CrossRefGoogle Scholar
  9. 9.
    Maggi, F.M., Montali, M., Westergaard, M., van der Aalst, W.M.P.: Monitoring business constraints with linear temporal logic: an approach based on colored automata. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 132–147. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-23059-2_13CrossRefGoogle Scholar
  10. 10.
    Mateescu, R., Rampacek, S.: Formal modelling and discretetime analysis of BPEL web services. Int. J. Simul. Process Model. 4(3–4), 183–194 (2008)CrossRefGoogle Scholar
  11. 11.
    Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)CrossRefGoogle Scholar
  12. 12.
    Padilha, B., Schwerz, A.L., Roberto, R.L.: WED-SQL: a relational framework for design and implementation of process-aware information systems. In: International Conference on Distributed Computing Systems Workshops, pp. 364–369. IEEE (2017)Google Scholar
  13. 13.
    Popova-Zeugmann, L.: Time petri nets. Time and Petri Nets, pp. 131–137. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-41115-1_3CrossRefzbMATHGoogle Scholar
  14. 14.
    Song, W., et al.: Timed modeling and verification of BPEL processes using time Petri nets. In: 2009 9th International Conference on Quality Software, QSIC 2009, pp. 92–97. IEEE (2009)Google Scholar
  15. 15.
    Wang, J.: Emergency healthcare workflow modeling and timeliness analysis. IEEE Trans. Syst. Man Cybern. 42(6), 1323–1331 (2012)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Rodrigo Alves Lima
    • 1
  • Calton Pu
    • 1
  • Bruno Padilha
    • 2
  • Pedro L. Takecian
    • 2
  • Leonardo T. Kamaura
    • 2
  • João E. Ferreira
    • 2
  1. 1.Georgia Institute of TechnologyAtlantaUSA
  2. 2.University of São PauloSão PauloBrazil

Personalised recommendations