Recursive Equations In Higher-Order Process Calculi

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Ying, Mingsheng en_US
dc.contributor.author Wirsing, Martin en_US
dc.contributor.editor en_US
dc.date.accessioned 2010-05-28T09:46:41Z
dc.date.available 2010-05-28T09:46:41Z
dc.date.issued 2001 en_US
dc.identifier 2008004834 en_US
dc.identifier.citation Ying Mingsheng and Wirsing Martin 2001, 'Recursive Equations In Higher-Order Process Calculi', Elsevier Science Bv, vol. 266, no. 1-Feb, pp. 839-852. en_US
dc.identifier.issn 0304-3975 en_US
dc.identifier.other C1UNSUBMIT en_US
dc.identifier.uri http://hdl.handle.net/10453/8965
dc.description.abstract Regarding behaviour equivalence in higher-order process calculi, Sangiorgi (Inform. and Comput. 131 (1996) 141) and Thomsen (Inform. and Comput. 116 (1995) 38) introduced context and higher-order bisimulations, respectively. In this paper, uniqueness of en_US
dc.language en_US
dc.publisher Elsevier Science Bv en_US
dc.relation.isbasedon http://dx.doi.org/10.1016/S0304-3975(00)00378-9 en_US
dc.title Recursive Equations In Higher-Order Process Calculi en_US
dc.parent Theoretical Computer Science en_US
dc.journal.volume 266 en_US
dc.journal.number 1-Feb en_US
dc.publocation Amsterdam en_US
dc.identifier.startpage 839 en_US
dc.identifier.endpage 852 en_US
dc.cauo.name FEIT.School of Systems, Management and Leadership en_US
dc.conference Verified OK en_US
dc.for 080203 en_US
dc.personcode 103396 en_US
dc.personcode 0000032973 en_US
dc.percentage 50 en_US
dc.classification.name Computational Logic and Formal Languages en_US
dc.classification.type FOR-08 en_US
dc.edition en_US
dc.custom en_US
dc.date.activity en_US
dc.location.activity en_US
dc.description.keywords NA en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record