On Infinite Guarded Recursive Specifications in Process Algebra

R.J. van Glabbeek; C.A. Middelburg

doi:10.48550/arXiv.2005.00746

On Infinite Guarded Recursive Specifications in Process Algebra

Research output: Book/Report › Other report

Abstract / Description of output

In most presentations of ACP with guarded recursion, recursive specifications are finite or infinite sets of recursion equations of which the right-hand sides are guarded terms. The completeness with respect to bisimulation equivalence of the axioms of ACP with guarded recursion has only been proved for the special case where recursive specifications are finite sets of recursion equations of which the right-hand sides are guarded terms of a restricted form known as linear terms. In this note,we widen this completeness result to the general case.

Original language	English
Number of pages	9
DOIs	https://doi.org/10.48550/arXiv.2005.00746
Publication status	Published - 2 May 2020

Keywords / Materials (for Non-textual outputs)

process algebra
guarded recursion
completeness
infinitary conditional equational logic

Access to Document

10.48550/arXiv.2005.00746Licence: All Rights Reserved

http://arxiv.org/abs/2005.00746Licence: All Rights Reserved

Cite this

@book{b0c92e6aadac4f898760b8d5a75bd0cf,

title = "On Infinite Guarded Recursive Specifications in Process Algebra",

abstract = "In most presentations of ACP with guarded recursion, recursive specifications are finite or infinite sets of recursion equations of which the right-hand sides are guarded terms. The completeness with respect to bisimulation equivalence of the axioms of ACP with guarded recursion has only been proved for the special case where recursive specifications are finite sets of recursion equations of which the right-hand sides are guarded terms of a restricted form known as linear terms. In this note,we widen this completeness result to the general case.",

keywords = "process algebra, guarded recursion, completeness, infinitary conditional equational logic",

author = "{van Glabbeek}, R.J. and C.A. Middelburg",

year = "2020",

month = may,

day = "2",

doi = "10.48550/arXiv.2005.00746",

language = "English",

}

TY - BOOK

T1 - On Infinite Guarded Recursive Specifications in Process Algebra

AU - van Glabbeek, R.J.

AU - Middelburg, C.A.

PY - 2020/5/2

Y1 - 2020/5/2

N2 - In most presentations of ACP with guarded recursion, recursive specifications are finite or infinite sets of recursion equations of which the right-hand sides are guarded terms. The completeness with respect to bisimulation equivalence of the axioms of ACP with guarded recursion has only been proved for the special case where recursive specifications are finite sets of recursion equations of which the right-hand sides are guarded terms of a restricted form known as linear terms. In this note,we widen this completeness result to the general case.

AB - In most presentations of ACP with guarded recursion, recursive specifications are finite or infinite sets of recursion equations of which the right-hand sides are guarded terms. The completeness with respect to bisimulation equivalence of the axioms of ACP with guarded recursion has only been proved for the special case where recursive specifications are finite sets of recursion equations of which the right-hand sides are guarded terms of a restricted form known as linear terms. In this note,we widen this completeness result to the general case.

KW - process algebra

KW - guarded recursion

KW - completeness

KW - infinitary conditional equational logic

U2 - 10.48550/arXiv.2005.00746

DO - 10.48550/arXiv.2005.00746

M3 - Other report

BT - On Infinite Guarded Recursive Specifications in Process Algebra

ER -

On Infinite Guarded Recursive Specifications in Process Algebra

Abstract / Description of output

Keywords / Materials (for Non-textual outputs)

Access to Document

Fingerprint

Cite this