Skip to main content
SpringerLink
Log in

Causality in Structured Occurrence Nets

  • Chapter
Dependable and Historic Computing

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

Abstract

Structured occurrence nets consist of multiple occurrence nets — each recording causality and concurrency in an execution of a component of a concurrent system. These occurrence nets are linked together by means of various types of relationships, aimed at representing dependencies between communicating and evolving sub-systems. In this paper, we investigate causality in the basic class of communication structured occurrence nets (cso-nets). We start by introducing the corresponding system-level model of communication structured Place Transition Nets (cspt-nets) which extend Place Transition Nets with an explicit structuring into communicating sub-systems and process interaction based on a combination of synchronous and asynchronous communication. After that we develop a cso-net based process semantics for cspt-nets showing that causality in cso-nets is underpinned by stratified order structures extending causal partial orders with weak causality.

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. Arbab, F.: A Channel-based Coordination Model for Component Composition. Mathematical Structures in Computer Science 14, 1–38 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Best, E., Devillers, R.: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science 55, 87–136 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bruni, R., Montanari, U.: Zero-safe nets: Comparing the Collective and Individual Token Approaches. Information and Computation 156, 46–89 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bruni, R., Montanari, U.: Zero-Safe Nets, or Transition Synchronization Made Simple. Electronic Notes in Theoretical Computer Science 7, 55–74 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Christensen, S., Hansen, D.: Coloured Petri Nets Extended with Channels for Synchronous Communication. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 159–178. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  6. Desel, J., Reisig, W.: Place/Transition Petri Nets. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 122–173. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Esparza, J., Heljanko, K.: Unfoldings: A Partial-Order Approach to Model Checking. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  8. Gaifman, H., Pratt, V.R.: Partial Order Models of Concurrency and the Computation of Functions. In: LICS, pp. 72–85. IEEE Computer Society, Los Alamitos (1987)

    Google Scholar 

  9. Guillen-Scholten, J., Arbab, F., de Boer, F., Bonsangue, M.: Modeling the Exogenous Coordination of Mobile Channel-based Systems with Petri Nets. Electronic Notes in Theoretical Computer Science 154, 121–138 (2006)

    Article  MATH  Google Scholar 

  10. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  11. Janicki, R., Koutny, M.: Invariants and Paradigms of Concurrency Theory. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991. LNCS, vol. 506, pp. 59–74. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  12. Janicki, R., Koutny, M.: Semantics of Inhibitor Nets. Information and Computation 123, 1–16 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kleijn, H.C.M., Koutny, M.: Process Semantics of General Inhibitor Nets. Information and Computation 190, 18–69 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Köhler-Bußmeier, M., Kudlek, M.: Linear Properties of Zero-Safe Nets with Debit Tokens. Fundamenta Informaticae 85, 329–342 (2008)

    MathSciNet  MATH  Google Scholar 

  15. Koutny, M., Randell, B.: Structured Occurrence Nets: A Formalism for Aiding System Failure Prevention and Analysis Techniques. Fundamenta Informaticae 97, 41–91 (2009)

    MathSciNet  MATH  Google Scholar 

  16. Kummer, O.: A Petri Net View on Synchronous Channels. Petri Net Newsletter 56, 7–11 (1999)

    Google Scholar 

  17. McMillan, K.L.: A Technique of State Space Search Based on Unfoldings. Formal Methods in System Design 6, 45–65 (1995)

    Article  MATH  Google Scholar 

  18. Meyer, R., Khomenko, V., Strazny, T.: A Practical Approach to Verification of Mobile Systems Using Net Unfoldings. Fundamenta Informaticae 94, 439–471 (2009)

    MathSciNet  MATH  Google Scholar 

  19. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  20. Randell, B.: Occurrence Nets Then and Now: The Path to Structured Occurrence Nets. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 1–16. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  21. Randell, B., Koutny, M.: Failures: Their Definition, Modelling and Analysis. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 260–274. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  22. Rozenberg, G., Engelfriet, J.: Elementary Net Systems. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 12–121. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIACS, Leiden University, P.O. Box 9512, NL-2300 RA, Leiden, The Netherlands

    Jetty Kleijn

  2. School of Computing Science, Newcastle University, Newcastle upon Tyne, NE1 7RU, United Kingdom

    Maciej Koutny

Authors
  1. Jetty Kleijn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Newcaslte University, Newcastle upon Tyne, NE1 7RU, UK

    Cliff B. Jones

  2. School of Computing Science, Newcastle University, NE1 7RU, Newcastle upon Tyne, UK

    John L. Lloyd

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kleijn, J., Koutny, M. (2011). Causality in Structured Occurrence Nets. In: Jones, C.B., Lloyd, J.L. (eds) Dependable and Historic Computing. Lecture Notes in Computer Science, vol 6875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24541-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24541-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24540-4

  • Online ISBN: 978-3-642-24541-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation