hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Lifting non-finite axiomatizability results to extensions of process algebras
Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
Vrije Universiteit Amsterdam, NL-1081HV, The Netherlands.
Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
Eindhoven University of Technology, NL-5600MB Eindhoven, The Netherlands.ORCID iD: 0000-0002-4869-6794
2008 (English)In: Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008 / [ed] Ausiello, G, Karhumaki, J, Mauri, G, Ong, L, New York: Springer-Verlag New York, 2008, Vol. 273, 301-316 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
New York: Springer-Verlag New York, 2008. Vol. 273, 301-316 p.
Series
IFIP International Federation for Information Processing, ISSN 1571-5736 ; 273
Keyword [en]
Nonfinite axiomatizability, Equational theory, Bisimulation, Shuffle, Speed, CCS
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:hh:diva-20502DOI: 10.1007/978-0-387-09680-3_21ISI: 000258429400021Scopus ID: 2-s2.0-48249148187ISBN: 978-0-387-09679-7 ISBN: 978-0-387-09680-3 OAI: oai:DiVA.org:hh-20502DiVA: diva2:584671
Conference
5th IFIP International Conference on Theoretical Computer Science held at the 20th World Computer Congress, Milan, ITALY, SEP 07-10, 2008
Available from: 2013-01-09 Created: 2013-01-08 Last updated: 2014-11-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Mousavi, Mohammad Reza
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 71 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf