{"title":"表征传递值的参数化过程的双相似性","authors":"Pawel Paczkowski","doi":"10.1016/S1571-0661(05)80676-0","DOIUrl":null,"url":null,"abstract":"<div><div>Symbolic transition graphs of Hennessy and Linextended with assignments are used to represent parametrisedvalue-passing processes. Semantics appealing to thenotion of state is introduced for the symbolic transition graphsand their extended version. Showing strong early bisimulation between finite symbolic transition graphs extended with assignments isreduced to solving sets of equations involving first-order state formulas.</div></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"5 ","pages":"Page 15"},"PeriodicalIF":0.0000,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Characterizing bisimilarity of value-passing parametrised processes\",\"authors\":\"Pawel Paczkowski\",\"doi\":\"10.1016/S1571-0661(05)80676-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Symbolic transition graphs of Hennessy and Linextended with assignments are used to represent parametrisedvalue-passing processes. Semantics appealing to thenotion of state is introduced for the symbolic transition graphsand their extended version. Showing strong early bisimulation between finite symbolic transition graphs extended with assignments isreduced to solving sets of equations involving first-order state formulas.</div></div>\",\"PeriodicalId\":38770,\"journal\":{\"name\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"5 \",\"pages\":\"Page 15\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571066105806760\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2005/5/3 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066105806760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2005/5/3 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
Characterizing bisimilarity of value-passing parametrised processes
Symbolic transition graphs of Hennessy and Linextended with assignments are used to represent parametrisedvalue-passing processes. Semantics appealing to thenotion of state is introduced for the symbolic transition graphsand their extended version. Showing strong early bisimulation between finite symbolic transition graphs extended with assignments isreduced to solving sets of equations involving first-order state formulas.
期刊介绍：
ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
