A modal characterization of observational congruence on finite terms of CCS

Q4 Mathematics
S. Graf, J. Sifakis
{"title":"A modal characterization of observational congruence on finite terms of CCS","authors":"S. Graf,&nbsp;J. Sifakis","doi":"10.1016/S0019-9958(86)80031-6","DOIUrl":null,"url":null,"abstract":"<div><p>We propose a translation method of finite terms of CCS into formulas of a modal language representing their class of observational congruence. For this purpose, we define a modal language and a function associating with any finite term of CCS a formula of the language, satisfied by the term. Furthermore, this function is such that two terms are congruent if and only if the corresponding formulas are equivalent. The translation method consists in associating with operations on terms (action, +) operations on the corresponding formulas. This work is a first step towards the definition of a modal language with modalities expressing both possibility and inevitability and which is compatible with observational congruence.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80031-6","citationCount":"83","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995886800316","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 83

Abstract

We propose a translation method of finite terms of CCS into formulas of a modal language representing their class of observational congruence. For this purpose, we define a modal language and a function associating with any finite term of CCS a formula of the language, satisfied by the term. Furthermore, this function is such that two terms are congruent if and only if the corresponding formulas are equivalent. The translation method consists in associating with operations on terms (action, +) operations on the corresponding formulas. This work is a first step towards the definition of a modal language with modalities expressing both possibility and inevitability and which is compatible with observational congruence.

CCS有限项上观测同余的模态表征
我们提出了一种将CCS的有限项转换为表示其观测同余类的模态语言公式的方法。为此,我们定义了一种模态语言和一个函数,该函数与CCS的任何有限项相关联,该语言的公式由该项满足。更进一步,当且仅当对应的公式相等时,这个函数的两项是全等的。转换方法包括将项(action, +)上的操作与相应公式上的操作相关联。这项工作是朝着模态语言的定义迈出的第一步,模态语言既表达可能性又表达必然性,并且与观察一致性兼容。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信