Operational Semantics for Timed Observations

Timed Observations is a semantical framework suitable to study the behaviour of timed concurrent processes. For each process we observe its external behaviour consisting of timed traces (the visible actions performed by the process and related to the instant time when they are executed), refusals (actions refused by a process after executing a trace), and the possibly divergent timed traces (traces that can be extended by an unbounded sequence of internal actions). Thus the model has a timed failures divergences semantics, and was already presented in [OdF90b] as a denotational semantics, which was applied to TCSP. In the present paper we concentrate on giving an equivalent operational characterization.

[1]  Matthew Hennessy,et al.  A Temporal Process Algebra , 1990, FORTE.

[2]  Willem P. de Roever,et al.  Compositional Semantics for Real-Time Distributed Computing , 1985, Inf. Comput..

[3]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[4]  David de Frutos-Escrig,et al.  TIC: A Timed Calculus for LOTOS , 1989, Formal Techniques for (Networked and) Distributed Systems.

[5]  David de Frutos-Escrig,et al.  A Complete Proof System for Timed Observations , 1991, TAPSOFT, Vol.1.

[6]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[7]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[8]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[9]  Iso. Lotos,et al.  A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour , 1985 .

[10]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[11]  A. W. Roscoe,et al.  An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.

[12]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[13]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[14]  Joseph Sifakis,et al.  ATP: an Algebra for Timed Processes , 1990, Programming Concepts and Methods.

[15]  A. W. Roscoe,et al.  Metric Spaces as Models for Real-Time Concurrency , 1987, MFPS.

[16]  David de Frutos-Escrig,et al.  Timed Observations: A Semantic Model for Real-Time Concurrency , 1990, Programming Concepts and Methods.

[17]  Willem P. de Roever,et al.  Compositional Semantics for Real-time Distributed Computing , 1985, Logic of Programs.