Behavioural Abstraction in TCCS

In this paper, we extend the theory of TCCS, the authors' Temporal Calculus of Communicating Systems, with a behavioural congruence which abstracts away internal communications. An equational theory for this equivalence is presented, and proven to be complete over the sublanguage of finite sequential agents.

[1]  Jan Friso Groote,et al.  Specification and verification of real time systems in ACP , 1990, PSTV.

[2]  Faron Moller,et al.  An overview of TCCS , 1992, Fourth Euromicro workshop on Real-Time Systems.

[3]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[4]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

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

[6]  Faron Moller,et al.  Relating Processes With Respect to Speed , 1991, CONCUR.

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

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

[9]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[10]  Faron Moller.  Process Algebra as a Tool for Real Time Analysis , 1991 .