Skip to main content

The step failure semantics

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

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

Included in the following conference series:

Abstract

The (linear) failure semantics is a well known model for the theoretical version of Hoare's CSP. We generalize this semantics by taking steps (i.e. multisets of simultaneously occurring actions) instead of single actions as the basic execution unit. Hence opposed to the linear semantics, where parallelism is modelled as arbitrary interleaving in order to avoid technical complication, the step failure semantics models true parallelism and is equally easy to manage. Opposed to the linear model here divergence is treated uniformly.

The relation to the linear semantics can be established using our newly introduced deparallelize operator.

Extended abstract

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold: Synchronized Behaviours of Processes and Rational Relations; Acta Informatica 17, 21–29 (1982)

    Google Scholar 

  2. S.D. Brookes, C.A.R. Hoare, A. W. Roscoe: A Theory of Communicating Sequential Processes; JACM 31, 560–599 (1984)

    Google Scholar 

  3. S.D. Brookes, A.W. Roscoe: An Improved Failures Model for Communicating Processes; in S.D. Brookes, A.W. Roscoe, G. Winskel (eds.): Seminar on Concurrency (1984); LNCS 197, 281–305

    Google Scholar 

  4. M. Broy: Process Semantics of Communicating Concurrent Programs; Univ. Passau, Report MIP-8602 (1986)

    Google Scholar 

  5. T. Elrad, N. Francez: Decomposition of Distributed Programs into Communication-closed Layers; Science of Computer Programming 2, 155–173 (1982)

    Google Scholar 

  6. N. Francez, C.A.R. Hoare, D.J. Lehmann, W.P. de Roever: Semantics of Nondeterminism, Concurrency, and Communication; JCSS 19, 290–308 (1979)

    Google Scholar 

  7. N. Francez, D. Lehmann, A. Pnueli: A Linear-history Semantics for Languages for Distributed Programming; TCS 32, 25–46 (1984)

    Google Scholar 

  8. U. Goltz, R. Loogen: Towards a Non-interleaving Semantic Model for CSP-like Languages; RWTH Aachen, Bericht Nr. 105 (1985)

    Google Scholar 

  9. C.A.R. Hoare: Communicating Sequential Processes; CACM 21, 666–677 (1978)

    Google Scholar 

  10. A. Kiehn: On the Concurrent Behaviour of Petri Nets; Univ. Hamburg, Bericht FBI-HH-B-119/86 (1986)

    Google Scholar 

  11. R. Loogen: Ein semantisches Modell für nichtdeterministische, parallele Prozesse; RWTH Aachen, Diploma Thesis (1985) unpublished

    Google Scholar 

  12. G.J. Milne: CIRCAL and the Representation of Communication, Concurrency, and Time; ACM TOPLAS 7, 270–298 (1985)

    Google Scholar 

  13. R. Milner: A Calculus of Communicating Systems; LNCS 92 (1980)

    Google Scholar 

  14. M. Nivat: Behaviours of Processes and Synchronized Systems of Processes; in: M.Broy, G.Schmidt(eds.): Theoretical Foundations of Programming Methodology, 473–551 (1986)

    Google Scholar 

  15. E.-R. Olderog, C.A.R. Hoare: Specification-oriented Semantics for Communicating Processes; Acta Informatica 23, 9–66 (1986)

    Google Scholar 

  16. G.D. Plotkin: An Operational Semantics for CSP; in: D. Bjørner (ed.): Formal Descriptions of Programming Concepts II, IFIP 1983, 199–223

    Google Scholar 

  17. W. Reisig: On the Semantics of Petri Nets; in: E.J.Neuhold, G.Chroust(eds.): Formal Models in Programming; IFIP 1985, 347–372

    Google Scholar 

  18. G. Rozenberg, R. Verraedt: Subset Languages of Petri Nets, Parts I and II; TCS 26, 301–326 (1986) and TCS 27, 85–108 (1986)

    Google Scholar 

  19. A. Salwicki, T. Müldner: On the Algorithmic Properties of Concurrent Programs; LNCS 125, 169–197 (1981)

    Google Scholar 

  20. M.W. Shields, P.E. Lauer: A Formal Semantics for Concurrent Systems; LNCS 71, 571–584 (1979)

    Google Scholar 

  21. D. Taubner: Two Net-oriented Semantics for TCSP; Univ. Hamburg, Bericht FBI-HH-B-116/85 (1985)

    Google Scholar 

  22. D. Taubner, W. Vogler: The Step Failure Semantics; Techn. Univ. München, Report TUM-18614 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Taubner, D., Vogler, W. (1987). The step failure semantics. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039618

Download citation

  • DOI: https://doi.org/10.1007/BFb0039618

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

  • Online ISBN: 978-3-540-47419-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics