An elimination theorem for regular behaviours with integration

Willem Jan Fokkink*

*Corresponding author for this work

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

Abstract

In this paper we consider we consider a variant of the process algebra ACP with rational time and integration. We shall indicate a subdomain of regular processes for which an Elimination Theorem holds: for each pair of processes p, q in this class there is a process z in this class such that p∥q and z have the same behaviour. Furthermore, we indicate by some simple examples that if the subdomain is restricted or enlarged, then the elimination result is lost. The subdomain has a strong link with the model of timed automata of Alur and Dill.

Original languageEnglish
Title of host publicationCONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings
EditorsEike Best
PublisherSpringer - Verlag
Pages432-446
Number of pages15
ISBN (Print)9783540572084
Publication statusPublished - 1 Jan 1993
Event4th International Conference on Concurrency Theory, CONCUR 1993 - Hildesheim, Germany
Duration: 23 Aug 199326 Aug 1993

Publication series

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

Conference

Conference4th International Conference on Concurrency Theory, CONCUR 1993
CountryGermany
CityHildesheim
Period23/08/9326/08/93

Keywords

  • ACP
  • Elimination Theorem
  • Integration
  • Regular process
  • Relative time

Fingerprint Dive into the research topics of 'An elimination theorem for regular behaviours with integration'. Together they form a unique fingerprint.

Cite this