文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite
侵权投诉

Categorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite

Abstract. We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of f

CategoricalModelsforFairnessandaFullyAbstractPresheafSemanticsofSCCSwithFiniteDelay

ThomasT.Hildebrandt

TheITUniversityofCopenhagen,Denmark,

hilde@it-c.dk

Abstract.Wepresentapresheafmodelfortheobservationofin niteaswellas nitecomputations.WeapplyittogiveadenotationalsemanticsofSCCSwith nitedelay,inwhichthemeaningsofrecursionaregivenby nalcoalgebrasandmeaningsof nitedelaybyinitialalgebrasoftheprocessequationsfordelay.Thiscanbeviewedasa rststepinrepresentingfairnessinpresheafsemantics.Wegiveaconcreterepresentationofthepresheafmodelasacategoryofgen-eralisedsynchronisationtreesandshowthatitiscore ectiveinacategoryofgeneralisedtransitionsystems,whichareaspecialcaseofthegeneraltransitionsystemsofHennessyandStirling.Theopenmapbisimulationisshowntoco-incidewithextendedbisimulationofHennessyandStirling,whichisessentiallyfairCTL-bisimulation.FinallyweformulateMilnersoperationalsemanticsofSCCSwith nitedelayintermsofgeneralisedtransitionsystemsandprovethatthepresheafsemanticsisfullyabstractwithrespecttoextendedbisimulation.Introduction

Whenreasoningaboutanddescribingthebehaviourofconcurrentagentsitisoftenthecasethatsomein nitecomputationsareconsideredunfairandconsequentlyruledoutasbeinginadmissible.AneconomicalwayofstudyingthissituationwasproposedbyMilnerin[25]showinghowtoexpressafairasynchronousparallelcompositioninhiscalculusSCCS(SynchronousCCS)byaddinga nite,butunboundeddelayoperator.Syntactically,the nitedelayofanagentiswritten.Theintendedsemanticsisthatcanperformanunboundednumberof-actions(delays)butmusteventuallyperformanaction,changingtoanagent,ifcanperformthisactionandchangeto,oritmusteventuallystop,ifcannotperformanyactions.Inotherwords,itsactionsarethesameasfor(thepossiblyin nitedelay),exceptthatin niteunfoldingoftherecursionisnotallowed.

Todealwithagentsinwhichonlysomein nitecomputationsareadmissible,onemustreaddresstheissueofhowtorepresentthebehaviourofagentsandsowhentwoagentsbehaveequally,i.e.theydenotethesameprocess.TheapproachusedforCCSandSCCS,takingtwoagentstobeequivalentiftheirderivationtreesarestrongbisimi-lar[23],willidentifyagentsthatonlydifferonwhethersomein nitecomputationsare

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email