Real-time behaviour of asynchronous agents

  • Wang Yi*
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

150 Scopus citations

Abstract

In this paper, we present a calculus for real-time communicating systems. The calculus is an extension of Milner's CCS with explicit time. In SCCS, (Formula Presented) means that if P exists at time r, it will proceed to Q at time r + 1. The time delay is exactly one unit. We extend this idea to asynchronous agents by allowing arbitrary delays. We write (Formula Presented) to mean that after t units of time, P will become Q, where e stands for idling. Based on the notion of bisimulation, two equivalence relations over agents are defined. It has been shown that the strong equivalence is a congruence and the weak one is preserved by all operators except summation and recursion [W90]. Various examples are given to illustrate the approach.

Original languageEnglish
Title of host publicationCONCUR 1990 - Theories of Concurrency
Subtitle of host publicationUnification and Extension, Proceedings
EditorsJ.W. Klop, J.C.M. Baeten, J.W. Klop, J.C.M. Baeten
PublisherSpringer Verlag
Pages502-520
Number of pages19
ISBN (Print)9783540530480
DOIs
StatePublished - 1990
Externally publishedYes
EventConference on Theories of Concurrency, CONCUR 1990 - Amsterdam, Netherlands
Duration: 27 Aug 199030 Aug 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume458 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceConference on Theories of Concurrency, CONCUR 1990
Country/TerritoryNetherlands
CityAmsterdam
Period27/08/9030/08/90

Fingerprint

Dive into the research topics of 'Real-time behaviour of asynchronous agents'. Together they form a unique fingerprint.

Cite this