用代数方法模拟和验证具有共享变量并发性的网络物理系统

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Ran Li , Huibiao Zhu , Richard Banach
{"title":"用代数方法模拟和验证具有共享变量并发性的网络物理系统","authors":"Ran Li ,&nbsp;Huibiao Zhu ,&nbsp;Richard Banach","doi":"10.1016/j.jlamp.2024.100973","DOIUrl":null,"url":null,"abstract":"<div><p>Cyber-Physical systems (CPS), containing discrete behaviors of the cyber and continuous behaviors of the physical, have gained wide applications in many fields. Since CPS subsume the intersection of cyber systems and physical processes, the traditional modeling languages which merely include discrete variables are no longer applicable to CPS. Accordingly, a shared variable language called <em>CPSL</em><span><math><msup><mrow></mrow><mrow><mi>s</mi><mi>c</mi></mrow></msup></math></span> was proposed to specify CPS. In this paper, we elaborate the algebraic semantics for this language, so that every program of <em>CPSL</em><span><math><msup><mrow></mrow><mrow><mi>s</mi><mi>c</mi></mrow></msup></math></span> can be converted into a unified form called guarded choice form and the sequentialization of parallel programs is achieved. Additionally, we formalize the algebraic semantics in the rewriting engine Real-Time Maude. With the algebraic laws constructed, for every program specified with <em>CPSL</em><span><math><msup><mrow></mrow><mrow><mi>s</mi><mi>c</mi></mrow></msup></math></span>, we can simulate its execution step by step. Furthermore, automatic transformation and execution are attained. As a consequence, if the program and its initial data state are provided, the corresponding trace of data states during execution can be generated. In the light of the generated trace, automatic verification can be carried out as well.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"139 ","pages":"Article 100973"},"PeriodicalIF":0.7000,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrency\",\"authors\":\"Ran Li ,&nbsp;Huibiao Zhu ,&nbsp;Richard Banach\",\"doi\":\"10.1016/j.jlamp.2024.100973\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Cyber-Physical systems (CPS), containing discrete behaviors of the cyber and continuous behaviors of the physical, have gained wide applications in many fields. Since CPS subsume the intersection of cyber systems and physical processes, the traditional modeling languages which merely include discrete variables are no longer applicable to CPS. Accordingly, a shared variable language called <em>CPSL</em><span><math><msup><mrow></mrow><mrow><mi>s</mi><mi>c</mi></mrow></msup></math></span> was proposed to specify CPS. In this paper, we elaborate the algebraic semantics for this language, so that every program of <em>CPSL</em><span><math><msup><mrow></mrow><mrow><mi>s</mi><mi>c</mi></mrow></msup></math></span> can be converted into a unified form called guarded choice form and the sequentialization of parallel programs is achieved. Additionally, we formalize the algebraic semantics in the rewriting engine Real-Time Maude. With the algebraic laws constructed, for every program specified with <em>CPSL</em><span><math><msup><mrow></mrow><mrow><mi>s</mi><mi>c</mi></mrow></msup></math></span>, we can simulate its execution step by step. Furthermore, automatic transformation and execution are attained. As a consequence, if the program and its initial data state are provided, the corresponding trace of data states during execution can be generated. In the light of the generated trace, automatic verification can be carried out as well.</p></div>\",\"PeriodicalId\":48797,\"journal\":{\"name\":\"Journal of Logical and Algebraic Methods in Programming\",\"volume\":\"139 \",\"pages\":\"Article 100973\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logical and Algebraic Methods in Programming\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2352220824000270\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logical and Algebraic Methods in Programming","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352220824000270","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

网络物理系统(CPS)包含离散的网络行为和连续的物理行为,已在许多领域得到广泛应用。由于 CPS 包含网络系统和物理过程的交集,仅包含离散变量的传统建模语言已不再适用于 CPS。因此,我们提出了一种名为 CPSLsc 的共享变量语言来指定 CPS。本文详细阐述了该语言的代数语义,从而使 CPSLsc 的每个程序都能转换成一种统一的形式,即守护选择形式,并实现了并行程序的顺序化。此外,我们还在重写引擎 Real-Time Maude 中形式化了代数语义。有了所构建的代数法则,对于每个用 CPSLsc 指定的程序,我们都可以逐步模拟其执行。此外,还可以实现自动转换和执行。因此,只要提供程序及其初始数据状态,就能生成执行过程中相应的数据状态跟踪。根据生成的轨迹,还可以进行自动验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrency

Cyber-Physical systems (CPS), containing discrete behaviors of the cyber and continuous behaviors of the physical, have gained wide applications in many fields. Since CPS subsume the intersection of cyber systems and physical processes, the traditional modeling languages which merely include discrete variables are no longer applicable to CPS. Accordingly, a shared variable language called CPSLsc was proposed to specify CPS. In this paper, we elaborate the algebraic semantics for this language, so that every program of CPSLsc can be converted into a unified form called guarded choice form and the sequentialization of parallel programs is achieved. Additionally, we formalize the algebraic semantics in the rewriting engine Real-Time Maude. With the algebraic laws constructed, for every program specified with CPSLsc, we can simulate its execution step by step. Furthermore, automatic transformation and execution are attained. As a consequence, if the program and its initial data state are provided, the corresponding trace of data states during execution can be generated. In the light of the generated trace, automatic verification can be carried out as well.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Logical and Algebraic Methods in Programming
Journal of Logical and Algebraic Methods in Programming COMPUTER SCIENCE, THEORY & METHODS-LOGIC
CiteScore
2.60
自引率
22.20%
发文量
48
期刊介绍: The Journal of Logical and Algebraic Methods in Programming is an international journal whose aim is to publish high quality, original research papers, survey and review articles, tutorial expositions, and historical studies in the areas of logical and algebraic methods and techniques for guaranteeing correctness and performability of programs and in general of computing systems. All aspects will be covered, especially theory and foundations, implementation issues, and applications involving novel ideas.
×
引用
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学术官方微信