A Decidable Characterization of a Graphical Pi-calculus with Iterators

Infinity Pub Date : 2010-09-21 DOI:10.4204/EPTCS.39.4
F. Peschanski, Hanna Klaudel, Raymond R. Devillers
{"title":"A Decidable Characterization of a Graphical Pi-calculus with Iterators","authors":"F. Peschanski, Hanna Klaudel, Raymond R. Devillers","doi":"10.4204/EPTCS.39.4","DOIUrl":null,"url":null,"abstract":"This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics of Pi-graphs use ground notions of labelled transition and bisimulation, which means standard verification techniques can be applied. We show that bisimilarity is decidable for the proposed semantics, a result obtained thanks to an original notion of causal clock as well as the automatic garbage collection of unused names.","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"35 1","pages":"47-61"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Infinity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.39.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics of Pi-graphs use ground notions of labelled transition and bisimulation, which means standard verification techniques can be applied. We show that bisimilarity is decidable for the proposed semantics, a result obtained thanks to an original notion of causal clock as well as the automatic garbage collection of unused names.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一类具有迭代器的图形pi -微积分的可定刻划
本文介绍了pi图,一种用于移动系统建模和验证的可视化范例。该语言是pi演算的图形化变体,使用迭代器来表达非终止行为。pi -graph的操作语义使用标记转换和双仿真的基本概念,这意味着可以应用标准验证技术。我们表明,对于所提出的语义,双相似性是可确定的,这一结果得益于因果时钟的原始概念以及未使用名称的自动垃圾收集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.30
自引率
0.00%
发文量
26
审稿时长
10 weeks
期刊最新文献
Sistem Informasi Perpustakaan Pada SMKN 3 Tana Toraja Dengan Metode Rapid Application Development (RAD) Perancangan Sistem Informasi Paket Wisata Berbasis Web Studi Kasus Sarira Trip Penggunaan YOLOv4 Untuk Menentukan Lokasi Dosen Dan Mahasiswa Dengan Menggunakan CCTV Aplikasi Reservasi Pantan Toraja Hotel Prediksi Persediaan Sepeda Motor Pada Dealer Yamaha Jaya Baru Motor Mengunakan Metode Frequent Pattern (FF-Growth)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1