Skip to main content
Springer Nature Link
Log in

Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow

  • Conference paper
  • First Online:
Application and Theory of Petri Nets 2002 (ICATPN 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2360))

Included in the following conference series:

  • 751 Accesses

Abstract

We propose extensions to predicate/transition nets to allow tokens to carry both data and control information, where such control can refine special “refinable place nodes” in the net. These formal extensions find use in active document workflow, in which documents themselves specify portions of the overall processing within a workflow net. Our approach enables the workflow designer to specify which places of the target predicate/transition net may be refined and it enables the document author to specify how these places will be refined (via attachment of a token-generated “refinement net”). This apportionment of the overall task allows the workflow designer to set general constraints within which the document author can control the processing; it prevents conflicts between them in foreseeable practical cases. Refinable places are augmented with a permission structure specifying which document authors can refine that place and which document tokens can execute a node’s refinement net. Our refined nets have a hierarchical structure which can be represented by bipartite trees.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Wil M. P. van der Aalst. Three good reasons for using a Petri-net-based workflow management system. In Information and process integration in enterprises: Rethinking documents, pages 161–182. Kluwer Academic, Norwell, MA, 1998.

    Google Scholar 

  2. Wil M. P. van der Aalst. Interorganizational workflows: An approach based on message sequence charts and Petri nets. Systems analysis — Modelling — Simulation, 35(3):345–357, 1999.

    MATH  Google Scholar 

  3. Wil M. P. van der Aalst, Jörg Desel, and Andreas Oberweis, editors. Business Process Management: Models, Techniques, and Empirical Studies. Springer, New York, NY, 2000.

    Google Scholar 

  4. Luca Aceto and Matthew Hennessy. Adding action refinement to a finite process algebra. Information and Computation, 115(2):179–247, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  5. Eric Badouel and Javier Oliver. Reconfigurable nets, a class of high level Petri nets supporting dynamic changes. (WFM) Workshop within the 19th International Conference on Applications and Theory of Petri Nets, pages 129–145, 1999.

    Google Scholar 

  6. Michel Bauderon and Bruno Courcelle. Graph expressions and graph rewriting. Mathematical Systems Theory, 20(83–127), 1987.

    Google Scholar 

  7. Wilfried Brauer, Robert Gold, and Walter Vogler. A survey of behaviour and equivalence preserving refinement of Petri nets. In Grzegorz Rozenberg, editor, Advances in Petri Nets 1990, number 483 in LNCS, 1991.

    Google Scholar 

  8. R. Kent Dybvig. The Scheme programming language: ANSI Scheme. Prentice Hall, Upper Saddle River, NJ, 1996.

    Google Scholar 

  9. Hartmann J. Genrich. Predicate/transition nets. In Advances in Petri Nets 1986, volume 254 of LNCS, pages 207–2471. Springer-Verlag, 1987.

    Google Scholar 

  10. Hartmann J. Genrich and Kurt Lautenbach. System modelling with high-level Petri nets. Theoretical Computer Science, 13(1):109–136, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  11. Rob van Glabbeek and Ursula Goltz. Refinement of actions in causality based models. In Jaco W. de Bakker, Willem Paul de Roever, and Grzegorz Rozenberg, editors, Proceedings REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands, May/June 1989, volume 430 of Lecture Notes in Computer Science (LNCS), pages 267–300. Springer, 1990.

    Google Scholar 

  12. Rob van Glabbeek and W. Peter Weijland. Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555–600, 1996.

    Article  MathSciNet  Google Scholar 

  13. Kurt Jensen. Coloured Petri nets and the invariant-method. Theoretical Computer Science, 14(3):317–336, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  14. Kurt Jensen. Coloured Petri Nets-Basic Concepts, Analysis Methods and Practical Use, Vol. 1. Springer-Verlag, 1992.

    Google Scholar 

  15. Donald E. Knuth. TEX: The Program, Computers and Typesetting. Addison-Wesley, Reading, MA, 1986.

    Google Scholar 

  16. Frank Leymann and Dieter Roller. Production Workflow: Concepts and Techniques. Prentice Hall, Upper Saddle River, NJ, 2000.

    MATH  Google Scholar 

  17. Michael Köhler, Daniel Moldt, and Heiko Rölke. Liveness preserving composition of agent Petri nets. Technical report, Universität Hamburg, Fachbereich Informatik, 2001.

    Google Scholar 

  18. Michael Köhler, Daniel Moldt, and Heiko Rölke. Modelling the structure and behaviour of Petri net agents. In José-Manuel Colom and Maciej Koutny, editors, Applications and Theory of Petri Nets 2001, pages 224–241, 2001.

    Google Scholar 

  19. Robin Milner. Communicating and Mobile Systems: The π-calculus. Cambridge University Press, Cambridge, UK, 1999.

    Google Scholar 

  20. Ethan Mirsky and Andre DeHon. MATRIX: A reconfigurable computing architecture with configurable instruction distribution and deployable resources. In Peter Athanas and Kevin L. Pocek, editors, Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 157–166, 1996.

    Google Scholar 

  21. Tadao Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541–580, 1989.

    Article  Google Scholar 

  22. Wolfgang Reisig. Elements of Distributed Algorithms: Modeling and analysis with Petri nets. Springer, Berlin, Germany, 1998.

    MATH  Google Scholar 

  23. Einar Smith. Principles of high-level Petri nets. In Wolfgang Reisig and Grzegorz Rozenberg, editors, Lectures on Petri nets I: Basic models, volume 1491 of Advances in Petri nets, pages 174–210. Springer, 1998.

    Google Scholar 

  24. Robert Valette. Analysis of Petri nets by stepwise refinements. Journal of Computer and System Sciences, 18(1):35–46, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  25. Rüdiger Valk. Self-modifying nets, a natural extension of Petri nets. In Proceedings ICALP’ 78, volume 62 of Lecture Notes in Computer Science (LNCS), pages 464–476. Springer, 1978.

    Google Scholar 

  26. Rüdiger Valk. Petri nets as token objects: An introduction to elementary object nets. In Jörg Desel and Manual Silva, editors, Application and Theory of Petri Nets, volume 1420 of Lecture Notes in Computer Science (LNCS), pages 1–25. Springer, 1989.

    Google Scholar 

  27. Patrick Henry Winston and Berthold Klaus Paul Horn. Lisp. Addison-Wesley, Reading, MA, third edition, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ricoh California Research Center, 2882 Sand Hill Road Suite 115, Menlo Park, CA, 94025-7022

    David G. Stork

  2. Department of Computer Science, Stanford University, Stanford, CA, 94305

    Rob van Glabbeek

Authors
  1. David G. Stork
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rob van Glabbeek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Informatics, University of Edinburgh, James Clerk Maxwell Building, The King’s Buildings Mayfield Road, Edinburgh, EH9 3JZ, UK

    Javier Esparza

  2. Department of Computer Science, University of Adelaide, North Terrace, Adelaide, SA, 5005, Australia

    Charles Lakos

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stork, D.G., van Glabbeek, R. (2002). Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow. In: Esparza, J., Lakos, C. (eds) Application and Theory of Petri Nets 2002. ICATPN 2002. Lecture Notes in Computer Science, vol 2360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48068-4_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-48068-4_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43787-1

  • Online ISBN: 978-3-540-48068-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics