TIC: A timed calculus

1 May 1993

journal article
research article
Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing

Vol. 5 (3) , 224-252
https://doi.org/10.1007/bf01211556

Abstract

TIC is a timed algebraic calculus which combines ideas from asynchronous and synchronous calculi. Time is introduced by assigning explicit time restrictions to the events of an asynchronous calculus. The semantics is defined in an operational way. Interleaving of behaviours is defined in such a way that a proper merge of events in time is achieved. Weak timed bisimulation is also defined. Examples are presented to show the applicability of the calculus to the study of timed behaviours.

Keywords

This publication has 13 references indexed in Scilit:

LOTOS-like process algebras with urgent or timed interactions
Published by Elsevier ,1992
Real time process algebra
Formal Aspects of Computing, 1991
A timed failures model for extended communicating processes
Published by Springer Nature ,1987
A timed model for communicating sequential processes
Lecture Notes in Computer Science, 1986
CIRCAL and the representation of communication, concurrency, and time
ACM Transactions on Programming Languages and Systems, 1985
Compositional semantics for real-time distributed computing
Published by Springer Nature ,1985
Algebra of communicating processes with abstraction
Theoretical Computer Science, 1985
Testing equivalences for processes
Theoretical Computer Science, 1984
Calculi for synchrony and asynchrony
Theoretical Computer Science, 1983
Recoverability of Communication Protocols--Implications of a Theoretical Study
IEEE Transactions on Communications, 1976