Decidable Fragments of a Higher Order Calculus with Locations

Hans Hüttel, Jens Christian Godskesen, Bjørn Haagensen, Mikkel Bundgaard

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

2 Citationer (Scopus)

Abstrakt

Homer is a higher order process calculus with locations. In this paper we study Homer in the setting of the semantic finite control property, which is a finite reachability criterion that implies decidability of barbed bisimilarity. We show that strong and weak barbed bisimilarity are undecidable for Homer. We then identify and compare two distinct subcalculi of Homer that both satisfy the semantic finite control property. One subcalculus is obtained by using a type system bounding the size of process terms. The other subcalculus is obtained by considering the image of the encoding of the finite control π-calculus in Homer.
OriginalsprogEngelsk
TitelProceedings of the 15th Workshop on Expressiveness in Concurrency (EXPRESS 2008)
RedaktørerDaniele Gorla, Thomas Hildebrandt
ForlagElsevier
Publikationsdato2009
Sider113-138
DOI
StatusUdgivet - 2009
BegivenhedInternational Workshop on Expressiveness in Concurrency (EXPRESS'08) - Toronto, Canada
Varighed: 23 aug. 200823 aug. 2008
Konferencens nummer: 15

Konference

KonferenceInternational Workshop on Expressiveness in Concurrency (EXPRESS'08)
Nummer15
LandCanada
ByToronto
Periode23/08/200823/08/2008
NavnElectronic Notes in Theoretical Computer Science
Nummer242
Vol/bind1
ISSN1571-0661

Emneord

  • Proceskalkyle
  • Concurrency

Fingeraftryk Dyk ned i forskningsemnerne om 'Decidable Fragments of a Higher Order Calculus with Locations'. Sammen danner de et unikt fingeraftryk.

Citationsformater