Skip to main content
SpringerLink
Log in
Book cover

International Conference on Application and Theory of Petri Nets and Concurrency

PETRI NETS 2012: Application and Theory of Petri Nets pp 148–167Cite as

On Profiles and Footprints – Relational Semantics for Petri Nets

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7347))

Abstract

Petri net systems have been successfully applied for modelling business processes and analysing their behavioural properties. In this domain, analysis techniques that are grounded on behavioural relations defined between pairs of transitions emerged recently. However, different use cases motivated different definitions of behavioural relation sets. This paper focusses on two prominent examples, namely behavioural profiles and behavioural footprints. We show that both represent different ends of a spectrum of relation sets for Petri net systems, each inducing a different equivalence class. As such, we provide a generalisation of the known relation sets. We illustrate that different relation sets complement each other for general systems, but form an abstraction hierarchy for distinguished net classes. For these net classes, namely S-WF-systems and sound free-choice WF-systems, we also prove a close relation between the structure and the relational semantics. Finally, we discuss implications of our results for the field of business process modelling and analysis.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. van der Aalst, W.M.P.: The application of Petri nets to workflow management. Journal of Circuits, Systems, and Computers 8(1), 21–66 (1998)

    Article  Google Scholar 

  2. van der Aalst, W.M.P.: Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer, Berlin (2011)

    MATH  Google Scholar 

  3. van der Aalst, W.M.P., de Medeiros, A.K.A., Weijters, A.J.M.M.T.: Genetic Process Mining. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 48–69. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. van der Aalst, W.M.P., van Hee, K.M., Massuthe, P., Sidorova, N., van der Werf, J.M.E.M.: Compositional Service Trees. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 283–302. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. van der Aalst, W.M.P., Pesic, M., Schonenberg, M.H.: Declarative workflows: Balancing between flexibility and support. Computer Science - R&D 23(2), 99–113 (2009)

    Article  Google Scholar 

  6. van der Aalst, W.M.P., Stahl, C.: Modeling Business Processes: A Petri Net-Oriented Approach. MIT Press (2011)

    Google Scholar 

  7. van der Aalst, W.M.P., Weijters, A.J.M.M., Maruster, L.: Workflow Mining: Discovering Process Models from Event Logs. Knowledge & Data Engineering 16(9), 1128–1142 (2004)

    Article  Google Scholar 

  8. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press (1995)

    Google Scholar 

  9. van Dongen, B.F., Dijkman, R.M., Mendling, J.: Measuring Similarity between Business Process Models. In: Bellahsène, Z., Léonard, M. (eds.) CAiSE 2008. LNCS, vol. 5074, pp. 450–464. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Eshuis, R., Grefen, P.W.P.J.: Structural Matching of BPEL Processes. In: ECOWS, pp. 171–180. IEEE Computer Society (2007)

    Google Scholar 

  11. Esparza, J.: A polynomial-time algorithm for checking consistency of free-choice signal transition graphs. Fundamenta Informatica 62(2), 197–220 (2004)

    MathSciNet  MATH  Google Scholar 

  12. Huan, L., Motoda, H. (eds.): Feature Extraction, Construction and Selection: A Data Mining Perspective. Springer, Berlin (1998)

    MATH  Google Scholar 

  13. Kovalyov, A., Esparza, J.: A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. In: Proc. of the International Workshop on Discrete Event Systems (WODES), pp. 1–6. IEEE CS (1996)

    Google Scholar 

  14. Kunze, M., Weidlich, M., Weske, M.: Behavioral Similarity – A Proper Metric. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 166–181. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Li, C., Reichert, M., Wombacher, A.: Discovering Reference Models by Mining Process Variants Using a Heuristic Approach. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 344–362. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Li, C., Reichert, M., Wombacher, A.: Representing block-structured process models as order matrices: Basic concepts, formal properties, algorithms. Technical report, University of Twente, Enschede, The Netherlands (2009)

    Google Scholar 

  17. Lohmann, N., Verbeek, E., Dijkman, R.M.: Petri net transformations for business processes - a survey. T. Petri Nets and Other Models of Concurrency 2, 46–63 (2009)

    Article  Google Scholar 

  18. Montali, M., Pesic, M., van der Aalst, W.M.P., Chesani, F., Mello, P., Storari, F.: Declarative specification and verification of service choreographiess. TWEB 4(1) (2010)

    Google Scholar 

  19. Oanea, O., Sürmeli, J., Wolf, K.: Service Discovery Using Communication Fingerprints. In: Maglio, P.P., Weske, M., Yang, J., Fantinato, M. (eds.) ICSOC 2010. LNCS, vol. 6470, pp. 612–618. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Rosenblum, L.Y., Yakovlev, A.V.: Analysing semantics of concurrent hardware specifications. In: Int. Conf. on Parallel Processing (ICPP 1989), pp. 211–218 (1989)

    Google Scholar 

  21. Rozinat, A., van der Aalst, W.M.P.: Conformance checking of processes based on monitoring real behavior. Inf. Syst. 33(1), 64–95 (2008)

    Article  Google Scholar 

  22. Smirnov, S., Weidlich, M., Mendling, J.: Business process model abstraction based on synthesis from well-structured behavioral profiles. International Journal of Cooperative Information Systems, IJCIS (to appear, 2012)

    Google Scholar 

  23. Smirnov, S., Weidlich, M., Mendling, J., Weske, M.: Action patterns in business process model repositories. Computers in Industry (COMIND) 63(2), 98–111 (2012)

    Article  Google Scholar 

  24. Warshall, S.: A theorem on boolean matrices. Journal of the ACM 9(1), 11–12 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  25. Weidlich, M., Mendling, J., Weske, M.: Efficient consistency measurement based on behavioral profiles of process models. IEEE Trans. Software Eng. 37(3), 410–429 (2011)

    Article  Google Scholar 

  26. Weidlich, M., Polyvyanyy, A., Desai, N., Mendling, J., Weske, M.: Process compliance analysis based on behavioural profiles. Inf. Syst. 36(7), 1009–1025 (2011)

    Article  Google Scholar 

  27. Weidlich, M., Weske, M., Mendling, J.: Change propagation in process models using behavioural profiles. In: IEEE SCC, pp. 33–40. IEEE CS (2009)

    Google Scholar 

  28. van der Werf, J.M.E.M., van Dongen, B.F., Hurkens, C.A.J., Serebrenik, A.: Process Discovery Using Integer Linear Programming. Fundamenta Informatica 94(3-4), 387–412 (2009)

    MATH  Google Scholar 

  29. Weske, M.: Business Process Management: Concepts, Languages, Architectures. Springer, Berlin (2007)

    Google Scholar 

  30. Wolf, K.: Does My Service Have Partners? In: Jensen, K., van der Aalst, W.M.P. (eds.) Transactions on Petri Nets and Other Models of Concurrency II. LNCS, vol. 5460, pp. 152–171. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  31. Zha, H., Wang, J., Wen, L., Wang, C., Sun, J.: A workflow net similarity measure based on transition adjacency relations. Computers in Industry 61(5), 463–471 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technion – Israel Institute of Technology, Haifa, Israel

    Matthias Weidlich

  2. Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jan Martijn van der Werf

Authors
  1. Matthias Weidlich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Martijn van der Werf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire Spécification et Vérification, Ecole Normale Supérieure de Cachan, 61, avenue du Président Wilson, 94235, Cachan, France

    Serge Haddad

  2. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca, Viale Sarca, 336, 20126, Milano, Italy

    Lucia Pomello

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weidlich, M., van der Werf, J.M. (2012). On Profiles and Footprints – Relational Semantics for Petri Nets. In: Haddad, S., Pomello, L. (eds) Application and Theory of Petri Nets. PETRI NETS 2012. Lecture Notes in Computer Science, vol 7347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31131-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31131-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31130-7

  • Online ISBN: 978-3-642-31131-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation