A timed failures model for extended communicating processes | SpringerLink
Skip to main content
Springer Nature Link
Log in

A timed failures model for extended communicating processes

Extended abstract

  • Semantics, Concurrency
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1987)

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

Included in the following conference series:

Abstract

We develop a model for the real-time behaviour of an extension of communicating sequential processes, ECP: the timed failures model. ECP includes a time-out mechanism for actions that synchronize and a broadcast construct. The model maximalizes local activity in processes and allows the delay of enabled synchronization actions to be a-priori bounded. It is a direct generalization of the (non-timed) failures model: traces are generalized to time-action relations, associating actions to the times at which they occur, and failure-sets to time-failure relations, associating actions to the times at which they are refused. In addition to a-priori bounded delay of actions, the model supports nondiscrete time and concurrency of actions; it makes the semantic operators continuous and is fully abstract when actions and the times at which they take place are made observable.

Lots of interesting research has been done in the past, and the intention of this paper is to do even better for the benefit of man kind, Amen. ([EH87])

The research reported here originates in and extends work, conducted independently, by both authors as published in [KSRGA85, Bou86, HGR87]. During that time, the second author was at Balliol College, Oxford University, working at the Computing Laboratory and supported by a National Science Foundation graduate fellowship.

The author is currently working in and partially supported by ESPRIT project 937: “Debugging and Specification of Ada Real-Time Embedded Systems (DESCARTES)”

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

Access this chapter

Log in via an institution

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. ADA (1983). The programming Language Ada Reference Manual, LNCS 155, Springer-Verlag, New York.

    Google Scholar 

  2. ACETO, L., DE NICOLA, R., FANTECHI, A. (1986), “Testing Equivalences for Event Structures”. Nota Interna B4-63, Istituto di Elaborazione della Informazione, Consiglio Nazionale delle Ricerche, Pisa.

    Google Scholar 

  3. BOUCHER, A. (1986), D. Phil. Thesis, Oxford University.

    Google Scholar 

  4. BOUDOL, G., CASTELLANI, I. (1987), On the Semantics of Concurrency: Partial Orders and Transition Systems, in “Proceedings Colloquium on Trees in Algebra and Programming (CAAP)”, LNCS 249, pp. 123–138, Springer-Verlag, New York.

    Google Scholar 

  5. BERRY, G., COSSERAT, L. (1985), The ESTEREL Synchronous Programming Language and its Mathematical Semantics, in “Proceedings CMU Seminar on Concurrency”, LNCS 197, pp. 389–449, Springer-Verlag, New York.

    Google Scholar 

  6. BERGERAND, J-L., CASPI P., HALBWACHS, N. (1985), Outline of a real-time data flow language, in “Proceedings IEEE-CS Real-Time Systems Symposium”, San Diego.

    Google Scholar 

  7. BROOKES, S., D., HOARE, C., A., R., ROSCOE, W., A. (1984), A theory of communicating sequential processes, J. Assoc. Comput. Mach. 31, pp. 560–499.

    MathSciNet  Google Scholar 

  8. BARRINGER, H., KUIPER, R., PNUELI A. (1986), A Really Abstract Concurrent Model and its Temporal Logic, in “Proceedings 13th ACM Symposium on Principles of Programming Languages (POPL)”, pp. 173–183.

    Google Scholar 

  9. BROY, M. (1983), Applicative Real-Time Programming, in “Proceedings IFRE Conference on Information Processing (R.A. Mason ed.)”, No. 83, pp. 259–264, North Holland.

    Google Scholar 

  10. BRANQUART, P., LOUIS, G., WODON, L.P. (1982), An Analytic Description of CHILL, the CCITT High Level Language, LNCS 128, Springer-Verlag, New York.

    Google Scholar 

  11. GLASS, R., L. (1980), Real-Time: The “Lost World” Of Software Debugging and Testing, Communications ACM, Vol. 23-5, pp. 264–271.

    Article  Google Scholar 

  12. EVER-HADANI, R. (1987), “Semantics of Concurrent Prolog”. Draft M. Sc. Thesis, Department of Computer Science, Technion, Israel.

    Google Scholar 

  13. VAN GLABBEEK, R., VAANDRAGER, F. (1987), Petri net models for algebraic theories of concurrency, in “Proceedings Conference on Parallel Architectures and Languages Europe (PARLE)”, LNCS 2??, p.???-???, Springer-Verlag, New York.

    Google Scholar 

  14. HENNESSY, M. (1983), Synchronous and Asynchronous Experiments on Processes, Information and Control, Vol. 59, Nos. 1–3, pp. 36–83.

    Article  Google Scholar 

  15. HAREL, D. (1986), “Statecharts: A Visual Approach to Complex Systems (Revised)”. Technical report CS86-02, Department of Applied Mathematics, Weizmann Institute of Science, Israel. to appear in: Science of Computer Programming, 1987.

    Google Scholar 

  16. HUIZING, C., GERTH, R., DE ROEVER, W.-P. (1987), Full Abstraction of a Real-Time Denotational Semantics for an OCCAM-like language, in “Proceedings 14th ACM Symposium on Principles of Programming Languages (POPL)”, pp. 223–238.

    Google Scholar 

  17. HOOMAN, J. (1986), A Compositional Proof Theory for Real-Time Distributed Message Passing, in “Proceedings Conference on Parallel Architectures and Languages Europe (PARLE)”, LNCS 2??, p.???-???, Springer-Verlag, New York.

    Google Scholar 

  18. JONES, G. (1982), D. Phil. Thesis, Oxford University.

    Google Scholar 

  19. KOYMANS, R., DE ROEVER, W.-P. (1985), Examples of a Real-Time Temporal Logic Specification, in “Proceedings Analysis of Concurrent Systems”, LNCS 207, pp. 231–252, Springer-Verlag, New York.

    Google Scholar 

  20. KOYMANS, R., SHYAMASUNDAR, R.K., DE ROVER, W.-P., GERTH, R., ARUNKUMAR, S. Compositional Semantics for Real-Time Distributed Computing, in “Proceedings Logics of Programs”, LNCS 193, pp. 167–190, Springer-Verlag, New York. to appear in: Information and Control,1987.

    Google Scholar 

  21. KOYMANS, R., VYTOPIL, J., DE ROEVER, W.-P. (1983). Real-Time Programming and Asynchronous Message Passing, in “Proceedings 2nd ACM Symposium on Principles of Distributed Computing (PODC)” pp. 187–197.

    Google Scholar 

  22. MILNER, R. (1983), A Calculus for Communicating Processes, LNCS 92, Springer-Verlag, New York.

    Google Scholar 

  23. MOORE, E., F. (1956), Gedanken experiments on sequential machines, in “Automata studies (C. E. Shannon, J. McCarthy, eds.)”, pp. 129–153, Princeton University Press, Princeton N.Y.

    Google Scholar 

  24. DE NICOLA, R. (1985), Testing Equivalences and Fully Abstract Models for Communicating Processes, Ph. D. Thesis, Department of Computer Science, Edinburgh University. Also as: Nota Interna B85-22, Istituto di Elaborazione della Informazione, Consiglio Nazionale delle Ricerche, Pisa.

    Google Scholar 

  25. The Occam Language Reference Manual, Prentice Hall, 1984.

    Google Scholar 

  26. OLDEROG, E.-R. (1986), Process Theory: Semantics, Specification and Verification, in “Current Trends in Concurrency-overview and Tutorials (J.W. de Bakker, W.P. de Roever, eds.)”, LNCS 224, pp. 442–510, Springer-Verlag, New York.

    Google Scholar 

  27. PHILLIPS, I. (1986), Refusal testing, in “Proceedings 13th Colloquium Automata, Languages and Programming (ICALP)”, LNCS 226, pp. 304–314, Springer-Verlag, New York.

    Google Scholar 

  28. PNUELI, A. (1985), Linear and Branching Structures in the Semantics and Logics of Reactive Systems, in “Proceedings 12th Colloquium Automata, Languages and Programming (ICALP)”, LNCS 194, pp. 15–33, Springer-Verlag, New York.

    Google Scholar 

  29. REED, G., M., ROSCOE, A., W. (1986), A Timed Model for Communicating Sequential Processes, in “Proceedings 13th Colloquium Automata, Languages and Programming (ICALP)”, LNCS 226, pp. 314–323, Springer-Verlag, New York.

    Google Scholar 

  30. TAUBNER, D., VOGLER, W. (1987), The Step Failure Semantics, in “Proceedings 4th Symposium on Theoretical Aspects of Computer Science (STACS)”, LNCS 247, pp. 348–359, Springer-Verlag, New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB, Eindhoven, the Netherlands

    Rob Gerth

  2. Department of Mathematics, University Place, University of Southern California, 90089, Los Angeles, CA

    Andy Boucher

Authors
  1. Rob Gerth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andy Boucher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Ottmann

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gerth, R., Boucher, A. (1987). A timed failures model for extended communicating processes. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-18088-5_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18088-3

  • Online ISBN: 978-3-540-47747-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics