hh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • 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 (engelsk)Inngår i: 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, s. 301-316Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
New York: Springer-Verlag New York, 2008. Vol. 273, s. 301-316
Serie
IFIP International Federation for Information Processing, ISSN 1571-5736 ; 273
Emneord [en]
Nonfinite axiomatizability, Equational theory, Bisimulation, Shuffle, Speed, CCS
HSV kategori
Identifikatorer
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, id: diva2:584671
Konferanse
5th IFIP International Conference on Theoretical Computer Science held at the 20th World Computer Congress, Milan, ITALY, SEP 07-10, 2008
Tilgjengelig fra: 2013-01-09 Laget: 2013-01-08 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Mousavi, Mohammad Reza

Søk i DiVA

Av forfatter/redaktør
Mousavi, Mohammad Reza

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 141 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf