Skip to main content
SpringerLink
Log in

Models from Scenarios

  • Conference paper
Transactions on Petri Nets and Other Models of Concurrency VII

Part of the book series: Lecture Notes in Computer Science ((TOPNOC,volume 7480))

Abstract

Synthesis of Petri nets from behavioral descriptions has important applications in the design of systems in different application areas. In this paper we present a survey on the technique of region based synthesis of Petri nets from languages. Each word in a given language specifies one run of the searched Petri net, i.e. represents one observable scenario of the system.

We concentrate on recent developments for languages of different kinds of causal structures (such as partial orders and stratified order structures). Causal structures represent causal relationships between events of one run. Expressible causal relationships are for example direct and indirect causal dependency, concurrency and synchronicity of events.

Concerning infinite languages, several possibilities of a finite representation are discussed. As the goal of synthesis, place/transition nets and inhibitor nets as well as several restrictions of these net classes are used. The presented framework integrates all classical results on sequential languages.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), July 10-13, Bratislava, Slovak Republic. IEEE Computer Society (2007)

    Google Scholar 

  2. Badouel, E., Darondeau, P.: On the Synthesis of General Petri Nets. Technical Report 3025, Inria (1996)

    Google Scholar 

  3. Badouel, E., Darondeau, P.: Theory of Regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 529–586. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Process Mining Based on Regions of Languages. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 375–383. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri Nets from Finite Partial Languages. Fundam. Inform. 88(4), 437–468 (2008)

    MathSciNet  MATH  Google Scholar 

  6. Bergenthum, R., Desel, J., Mauser, S., Lorenz, R.: Construction of process models from example runs. In: Jensen, K., van der Aalst, W.M.P. (eds.) ToPNoC II. LNCS, vol. 5460, pp. 243–259. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Bergenthum, R., Desel, J., Mauser, S., Lorenz, R.: Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages. Fundam. Inform. 95(1), 187–217 (2009)

    MathSciNet  MATH  Google Scholar 

  8. Busi, N., Pinna, G.M.: Synthesis of Nets with Inhibitor Arcs. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 151–165. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  9. Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Hardware and Petri Nets: Application to Asynchronous Circuit Design. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 1–15. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Darondeau, P.: Deriving Unbounded Petri Nets from Formal Languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 533–548. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Darondeau, P.: Unbounded Petri Net Synthesis. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 413–438. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Desel, J.: From Human Knowledge to Process Models. In: Kaschek, R., Kop, C., Steinberger, C., Fliedl, G. (eds.) UNISCON. LNBIP, vol. 5, pp. 84–95. Springer, Heidelberg (2008)

    Google Scholar 

  13. Desel, J.: VipTool-Homepage (2010), http://www.fernuni-hagen.de/se/viptool.html

  14. Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-Structures. Part I: Basic Notions and the Representation Problem / Part II: State Spaces of Concurrent Systems. Acta Inf. 27(4), 315–368 (1989)

    Article  MathSciNet  Google Scholar 

  15. Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-Structures. Part II: State Spaces of Concurrent Systems. Acta Inf. 27(4), 343–368 (1989)

    Article  MathSciNet  Google Scholar 

  16. Hoogers, P., Kleijn, H., Thiagarajan, P.: A Trace Semantics for Petri Nets. Information and Computation 117(1), 98–114 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  17. van der Werf, C.H.J., van Dongen, B., Serebrenik, A.: Process Discovery using Integer Linear Programming. Fundamenta Informaticae 94(3), 387–412 (2009)

    MathSciNet  MATH  Google Scholar 

  18. Janicki, R., Koutny, M.: Semantics of Inhibitor Nets. Inf. Comput. 123(1), 1–16 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  19. Josephs, M.B., Furey, D.P.: A Programming Approach to the Design of Asynchronous Logic Blocks. In: Cortadella, J., Yakovlev, A., Rozenberg, G. (eds.) Concurrency and Hardware Design. LNCS, vol. 2549, pp. 34–60. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Juhas, G., Lorenz, R., Mauser, S.: Complete Process Semantics of Petri Nets. Fundamenta Informaticae 87(3-4), 331–365 (2008)

    MathSciNet  MATH  Google Scholar 

  21. Kleijn, H.C.M., Koutny, M.: Process Semantics of General Inhibitor Nets. Inf. Comput. 190(1), 18–69 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  22. Lodaya, K., Weil, P.: Series-Parallel Posets: Algebra, Automata and Languages. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 555–565. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  23. Lodaya, K., Weil, P.: Series-Parallel Languages and the Bounded-Width Property. Theor. Comput. Sci. 237(1-2), 347–380 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  24. Lorenz, R.: Synops-Homepage (2010), http://www.informatik.uni-augsburg.de/lehrstuehle/inf/projekte/synops/

  25. Lorenz, R., Juhás, G., Bergenthum, R., Desel, J., Mauser, S.: Executability of Scenarios in Petri Nets. Theor. Comput. Sci. 410(12-13), 1190–1216 (2009)

    Article  MATH  Google Scholar 

  26. Lorenz, R., Mauser, S., Bergenthum, R.: Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 342–361. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  27. Lorenz, R., Mauser, S., Juhás, G.: How to Synthesize Nets from Languages: A Survey. In: Henderson, S.G., Biller, B., Hsieh, M.-H., Shortle, J., Tew, J.D., Barton, R.R. (eds.) Winter Simulation Conference, pp. 637–647. WSC (2007)

    Google Scholar 

  28. Mukund, M.: Petri Nets and Step Transition Systems. Int. J. Found. Comput. Sci. 3(4), 443–478 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  29. Pietkiewicz-Koutny, M.: The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs. Fundam. Inform. 40(2-3), 251–283 (1999)

    MathSciNet  MATH  Google Scholar 

  30. Pietkiewicz-Koutny, M.: Synthesising Elementary Net Systems with Inhibitor Arcs from Step Transition Systems. Fundam. Inform. 50(2), 175–203 (2002)

    MathSciNet  MATH  Google Scholar 

  31. van der Aalst, W.M.P., Günther, C.W.: Finding Structure in Unstructured Processes: The Case for Process Mining. In: ACSD [1], pp. 3–12

    Google Scholar 

  32. van der Aalst, W.M.P., van Dongen, B.F., Herbst, J., Maruster, L., Schimm, G., Weijters, A.J.M.M.: Workflow Mining: A Survey of Issues and Approaches. Data Knowl. Eng. 47(2), 237–267 (2003)

    Article  Google Scholar 

  33. Zhou, M., Cesare, F.D.: Petri Net Synthesis for Discrete Event Control of Manufacturing Systems. Kluwer (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Augsburg, Germany

    Robert Lorenz

  2. Department of Software Engineering, Distance University of Hagen, Germany

    Jörg Desel

  3. Faculty of Electrical Engineering and Information Technology, Slovak University of Technology, Bratislava, Slovakia

    Gabriel Juhás

Authors
  1. Robert Lorenz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jörg Desel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gabriel Juhás
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science, Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, 8200, Aarhus N, Denmark

    Kurt Jensen

  2. Department of Information Systems, Eindhoven University of Technology, P.O. Box 513, NL-5600, Eindhoven, MB, The Netherlands

    Wil M. P. van der Aalst

  3. Dipartimento di Informatica, Università degli Studi di Torino, Corso Svizzera 185, 10149, Torino, Italy

    Gianfranco Balbo

  4. School of Computing Science, Newcastle University, Newcastle upon Tyne, UK

    Maciej Koutny

  5. Institut für Informatik, Universität Rostock, Germany

    Karsten Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lorenz, R., Desel, J., Juhás, G. (2013). Models from Scenarios. In: Jensen, K., van der Aalst, W.M.P., Balbo, G., Koutny, M., Wolf, K. (eds) Transactions on Petri Nets and Other Models of Concurrency VII. Lecture Notes in Computer Science, vol 7480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38143-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38143-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38142-3

  • Online ISBN: 978-3-642-38143-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation