TIC: A timed calculus-Reference-Cited by-同舟云学术

TIC: A timed calculus

Published:1993-05 Issue:3 Volume:5 Page:224-252
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Quemada Juan¹,de Frutos David²,Azcorra Arturo¹

Affiliation:

1. Departmento Ingeniería Telemática, ETSI Telecomunicación, Universidad Politécnica de Madrid, 28040, Madrid, Spain

2. Dpto. Informática y Automática, Fac. Ciencias Matemáticas, Universidad Complutense, Madrid, Spain

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01211556.pdf

Reference31 articles.

1. Algebre de Processus et Synchronisation;Austry D.;J TCS,1987

2. Azcorra A.: Modelado Formal de Sistemas Sincronos . PhD thesis Escuela Tecnica Superior de Ingenieros de Telecomunicacion Universidad Politecnica de Madrid 1989.

3. Real time process algebra

4. Algebra of communicating processes with abstraction

5. Bolognesi T. and Lucidi F.: LOTOS-like Process Algebras with Urgent or Timed Interactions. In FORTE'91: Formal Techniques IV Sidney November 1991.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis;Theoretical Computer Science;2024-09

2. revTPL: The Reversible Temporal Process Language;Logical Methods in Computer Science;2024-01-31

3. Causal Reversibility for Timed Process Calculi with Lazy/Eager Durationless Actions and Time Additivity;Lecture Notes in Computer Science;2023

4. Timed process calculi with deterministic or stochastic delays: Commuting between durational and durationless actions;Theoretical Computer Science;2016-05

5. A formal framework to test soft and hard deadlines in timed systems;Software Testing, Verification and Reliability;2011