An elimination theorem for regular behaviours with integration

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

Fingerprint

Algebra
Elimination
Theorem
Process Algebra
Timed Automata
Class
Model

Keywords

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

Cite this

Fokkink, W. J. (1993). An elimination theorem for regular behaviours with integration. In E. Best (Ed.), CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings (pp. 432-446). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 715 LNCS). Springer - Verlag.
Fokkink, Willem Jan. / An elimination theorem for regular behaviours with integration. CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings. editor / Eike Best. Springer - Verlag, 1993. pp. 432-446 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{49a4125f1ddf4c44b83c0b68cf0e3957,
title = "An elimination theorem for regular behaviours with integration",
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.",
keywords = "ACP, Elimination Theorem, Integration, Regular process, Relative time",
author = "Fokkink, {Willem Jan}",
year = "1993",
month = "1",
day = "1",
language = "English",
isbn = "9783540572084",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer - Verlag",
pages = "432--446",
editor = "Eike Best",
booktitle = "CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings",

}

Fokkink, WJ 1993, An elimination theorem for regular behaviours with integration. in E Best (ed.), CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 715 LNCS, Springer - Verlag, pp. 432-446, 4th International Conference on Concurrency Theory, CONCUR 1993, Hildesheim, Germany, 23/08/93.

An elimination theorem for regular behaviours with integration. / Fokkink, Willem Jan.

CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings. ed. / Eike Best. Springer - Verlag, 1993. p. 432-446 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 715 LNCS).

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

TY - GEN

T1 - An elimination theorem for regular behaviours with integration

AU - Fokkink, Willem Jan

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

KW - ACP

KW - Elimination Theorem

KW - Integration

KW - Regular process

KW - Relative time

UR - http://www.scopus.com/inward/record.url?scp=84925057286&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84925057286&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540572084

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 432

EP - 446

BT - CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings

A2 - Best, Eike

PB - Springer - Verlag

ER -

Fokkink WJ. An elimination theorem for regular behaviours with integration. In Best E, editor, CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings. Springer - Verlag. 1993. p. 432-446. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).