Skip to main content
SpringerLink
Log in

Towards Synthesis of Petri Nets from Scenarios

  • Conference paper
Petri Nets and Other Models of Concurrency - ICATPN 2006 (ICATPN 2006)

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

Included in the following conference series:

Abstract

Given a set of scenarios, we answer the question whether this set equals the set of all executions of a Petri net.

Formally, scenarios are expressed by (isomorphism classes of) labelled partial orders (LPOs), also known as pomsets or partial words. An LPO is an execution of a Petri net if it is a sequentialization of an LPO generated by a process of the net. We propose a definition of regions for a set of LPOs, i.e for a partial language. Given a partial language of scenarios, we prove a necessary and sufficient condition (based on regions) for the partial language of scenarios to be the partial language of executions of a place/transition Petri net. Finally, we prove our notion of regions to be consistent with the notion of regions of trace 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. van der Aalst, W.M.P., de Medeiros, A.K.A., Weijters, A.J.M.M.: Genetic Process Mining. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 48–69. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. van der Aalst, W.M.P., Weijters, T., Maruster, L.: Workflow Mining: Discovering Process Models from Event Logs. IEEE Trans. Knowl. Data Eng. 16(9), 1128–1142 (2004)

    Article  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)

    Google Scholar 

  4. Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving Petri Nets for Finite Transition Systems. IEEE Trans. Computers 47(8), 859–882 (1998)

    Article  MathSciNet  Google Scholar 

  5. Darondeau, P.: Unbounded Petri Net Synthesis. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 413–438. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Desel, J., Reisig, W.: The Synthesis Problem of Petri Nets. Acta Inf. 33(4), 297–315 (1996)

    Article  MathSciNet  Google Scholar 

  7. Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem. Acta Inf. 27(4), 315–342 (1989)

    Article  MathSciNet  Google Scholar 

  8. 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 

  9. Esparza, J., Heljanko, K.: Implementing LTL Model Checking with Net Unfoldings. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 37–56. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Ford Jr., L.R., Fulkerson, D.R.: Maximal Flow Through a Network. Canadian Journal of Mathematics 8, 399–404 (1955)

    Article  MathSciNet  Google Scholar 

  11. Goldberg, A., Rao, S.: Beyond the Flow Decomposition Barrier. Journal of the ACM 45(5), 783–797 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Goltz, U., Reisig, W.: The Non-Sequential Behaviour of Petri Nets. Information and Control 57(2-3), 125–147 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  13. Goltz, U., Reisig, W.: Processes of Place/Transition Nets. LNCS, vol. 154, pp. 264–277.Springer, Heidelberg (1983)

    Google Scholar 

  14. Grabowski, J.: On Partial Languages. Fundamenta Informaticae IV.2, 428–498 (1981)

    Google Scholar 

  15. Harel, D., Kugler, H., Pnueli, A.: Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 309–324. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Harel, D., Marelly, R.: Come, Let’s Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer, Heidelberg (2003)

    Google Scholar 

  17. Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A trace semantics for Petri nets. Information and Computation 117(1), 98–114 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  18. Juhás, G., Lorenz, R., Desel, J.: Can I execute my scenario in your net? In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 289–308. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Karzanov, A.V.: Determining the Maximal Flow in a Network by the Method of Preflows. Soviet Math. Doc. 15, 434–437 (1974)

    MATH  Google Scholar 

  20. Kiehn, A.: On the Interrelationship between Synchronized and Non-Synchronized Behavior of Petri Nets. Journal Inf. Process. Cybern. EIK 24, 3–18 (1988)

    MATH  MathSciNet  Google Scholar 

  21. Klose, J., Wittke, H.: An Automata Based Interpretation of Live Sequence Charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 512–527. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  22. Lettrari, M., Klose, J.: Scenario-Based Monitoring and Testing of Real-Time UML Models. In: Gogolla, M., Kobryn, C. (eds.) UML 2001. LNCS, vol. 2185, pp. 317–328. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  23. Mansurov, N.: Automatic synthesis of SDL from MSC and its applications in forward and reverse engineering. Comput. Lang. 27(1), 115–136 (2001)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  25. Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary Transition Systems. Theor. Comput. Sci. 96(1), 3–33 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  26. Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Transition systems, event structures and unfoldings. Information and Computation 118(2), 191–207 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  27. Pratt, V.: Modelling Concurrency with Partial Orders. Int. Journal of Parallel Programming 15, 33–71 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  28. Roychoudhury, A., Thiagarajan, P.S., Tran, T., Zvereva, V.A.: Automatic Generation of Protocol Converters from Scenario-Based Specifications. In: Proceedings of the 25th IEEE Real-Time Systems Symposium (RTSS 2004), pp. 447–458 (2004)

    Google Scholar 

  29. Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Angewandte Informatik, Katholische Universität Eichstätt-Ingolstadt, Eichstätt, Germany

    Robert Lorenz

  2. 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. Gabriel Juhás
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, 10149, Torino, Italy

    Susanna Donatelli

  2. School of Computing, National University of Singapore,  

    P. S. Thiagarajan

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lorenz, R., Juhás, G. (2006). Towards Synthesis of Petri Nets from Scenarios. In: Donatelli, S., Thiagarajan, P.S. (eds) Petri Nets and Other Models of Concurrency - ICATPN 2006. ICATPN 2006. Lecture Notes in Computer Science, vol 4024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11767589_17

Download citation

  • DOI: https://doi.org/10.1007/11767589_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34699-9

  • Online ISBN: 978-3-540-34700-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation