Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras

L. Aceto; W.J. Fokkink; A. Ingólfsdóttir; M.R. Mousavi

doi:10.1007/978-0-387-09680-3_21

Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras

L. Aceto
, W.J. Fokkink
, A. Ingólfsdóttir
, M.R. Mousavi

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

168 Downloads (Pure)

Abstract

This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational proofs over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller’s celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied.

Original language	English
Title of host publication	Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008
Subtitle of host publication	IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy
Editors	Giorgio Ausiello
Publisher	Springer
Pages	301-316
Number of pages	16
ISBN (Electronic)	9780387096803
ISBN (Print)	9780387096797, 9781441935144
DOIs	https://doi.org/10.1007/978-0-387-09680-3_21
Publication status	Published - 2008

Publication series

Name	IFIP
Publisher	Springer Science and Business Media, LLC
Volume	273
ISSN (Print)	1571-5736

Bibliographical note

DBLP:conf/ifipTCS/AcetoFIM08
Proceedings title: Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy
Publisher: Springer
Editors: G. Ausiello, J. Karhumäki, G. Mauri, C.-H. Luke Ong

Access to Document

10.1007/978-0-387-09680-3_21

219539Final published version, 382 KB

Persistent URL (handle)

Persistent link

Cite this

Aceto, L., Fokkink, W. J., Ingólfsdóttir, A., & Mousavi, M. R. (2008). Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. In G. Ausiello (Ed.), Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008: IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy (pp. 301-316). (IFIP; Vol. 273). Springer. https://doi.org/10.1007/978-0-387-09680-3_21

Aceto, L. ; Fokkink, W.J. ; Ingólfsdóttir, A. et al. / Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008: IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy. editor / Giorgio Ausiello. Springer, 2008. pp. 301-316 (IFIP).

@inproceedings{198c8a83d0684335b83bfcbb21d524b1,

title = "Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras",

abstract = "This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational proofs over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller{\textquoteright}s celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied.",

author = "L. Aceto and W.J. Fokkink and A. Ing{\'o}lfsd{\'o}ttir and M.R. Mousavi",

note = "DBLP:conf/ifipTCS/AcetoFIM08 Proceedings title: Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy Publisher: Springer Editors: G. Ausiello, J. Karhum{\"a}ki, G. Mauri, C.-H. Luke Ong",

year = "2008",

doi = "10.1007/978-0-387-09680-3\_21",

language = "English",

isbn = "9780387096797",

series = "IFIP",

publisher = "Springer",

pages = "301--316",

editor = "Giorgio Ausiello",

booktitle = "Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008",

}

Aceto, L, Fokkink, WJ, Ingólfsdóttir, A & Mousavi, MR 2008, Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. in G Ausiello (ed.), Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008: IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy. IFIP, vol. 273, Springer, pp. 301-316. https://doi.org/10.1007/978-0-387-09680-3_21

Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. / Aceto, L.; Fokkink, W.J.; Ingólfsdóttir, A. et al.
Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008: IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy. ed. / Giorgio Ausiello. Springer, 2008. p. 301-316 (IFIP; Vol. 273).

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras

AU - Aceto, L.

AU - Fokkink, W.J.

AU - Ingólfsdóttir, A.

AU - Mousavi, M.R.

N1 - DBLP:conf/ifipTCS/AcetoFIM08 Proceedings title: Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy Publisher: Springer Editors: G. Ausiello, J. Karhumäki, G. Mauri, C.-H. Luke Ong

PY - 2008

Y1 - 2008

N2 - This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational proofs over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller’s celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied.

AB - This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational proofs over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller’s celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied.

U2 - 10.1007/978-0-387-09680-3_21

DO - 10.1007/978-0-387-09680-3_21

M3 - Conference contribution

SN - 9780387096797

SN - 9781441935144

T3 - IFIP

SP - 301

EP - 316

BT - Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008

A2 - Ausiello, Giorgio

PB - Springer

ER -

Aceto L, Fokkink WJ, Ingólfsdóttir A, Mousavi MR. Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. In Ausiello G, editor, Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008: IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy. Springer. 2008. p. 301-316. (IFIP). Epub 2008 Jul 22. doi: 10.1007/978-0-387-09680-3_21

Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras

Abstract

Publication series

Bibliographical note

Access to Document

Persistent URL (handle)

Fingerprint

Cite this