# A timed failures model for extended communicating processes

## 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])

## Keywords

Bounded Delay Failure Relation Nondeterministic Choice Concurrency Operator Internal Choice## Preview

Unable to display preview. Download preview PDF.

## References

- [A83]ADA (1983).
**The programming Language Ada Reference Manual**, LNCS**155**, Springer-Verlag, New York.Google Scholar - [ANF86]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
- [Bou86]BOUCHER, A. (1986), D. Phil. Thesis, Oxford University.Google Scholar
- [BoC87]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 - [BC85]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 - [BCH85]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 - [BHR84]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.MathSciNetGoogle Scholar - [BKP86]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 - [Bro83]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 - [BLW82]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 - [Gla80]GLASS, R., L. (1980), Real-Time: The “Lost World” Of Software Debugging and Testing,
*Communications ACM*, Vol.**23-5**, pp. 264–271.CrossRefGoogle Scholar - [EH87]EVER-HADANI, R. (1987), “Semantics of Concurrent Prolog”. Draft M. Sc. Thesis, Department of Computer Science, Technion, Israel.Google Scholar
- [GV87]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 - [Hen83]HENNESSY, M. (1983), Synchronous and Asynchronous Experiments on Processes,
*Information and Control*, Vol.**59**, Nos.**1–3**, pp. 36–83.CrossRefGoogle Scholar - [Har86]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 - [HGR87]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 - [Hoo86]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 - [Jon82]JONES, G. (1982), D. Phil. Thesis, Oxford University.Google Scholar
- [KR85]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 - [KSRGA85]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 - [KVR83]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 - [Mil79]MILNER, R. (1983),
**A Calculus for Communicating Processes**, LNCS**92**, Springer-Verlag, New York.Google Scholar - [Moo56]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 - [Nic85]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
- [Occ84]
**The Occam Language Reference Manual**, Prentice Hall, 1984.Google Scholar - [Old86]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 - [Phi86]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 - [Pnu85]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 - [RR86]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 - [TV87]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