基于集成数据库表的定时Petri网形式化验证方法

IF 8.7 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Jian Song;Guanjun Liu;Ying Tang;Li Wang;Miaomiao Wang;Lin Li
{"title":"基于集成数据库表的定时Petri网形式化验证方法","authors":"Jian Song;Guanjun Liu;Ying Tang;Li Wang;Miaomiao Wang;Lin Li","doi":"10.1109/TSMC.2025.3585039","DOIUrl":null,"url":null,"abstract":"Formal verification becomes increasingly critical to ensure system functionality, reliability and safety as they grow in complexity. Existing methods tend to focus on a single dimension of system aspects—such as control flow, data flow or timing constraints—or, at most, consider two of these perspectives without integrating all three. In addition, data flow models generally represent high-level data abstraction without including operational details within underlying contexts. The inability of these models to capture system behavior undermines their reliability, ultimately increasing the likelihood of the corresponding systems malfunctioning. To address these issues, we propose a formal verification method based on a timed Petri net with database tables (TPDT-net). First, we model the system using TPDT-net and generate its state reachability graph (SRG). Next, we extend timed computation tree logic (TCTL) by introducing database-related data element operators, thus proposing a database-oriented TCTL (DTCTL) model checking method. In addition, we formalize the system correctness problem as corresponding DTCTL formulas, which are analyzed based on the SRG. This approach transforms correctness verification into a satisfiability problem of DTCTL formulas within the SRG. Finally, we validate the practicality and effectiveness of the proposed method through case studies and experiments.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7410-7424"},"PeriodicalIF":8.7000,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Innovative Formal Verification Method Based on Timed Petri Nets With Integrated Database Tables\",\"authors\":\"Jian Song;Guanjun Liu;Ying Tang;Li Wang;Miaomiao Wang;Lin Li\",\"doi\":\"10.1109/TSMC.2025.3585039\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Formal verification becomes increasingly critical to ensure system functionality, reliability and safety as they grow in complexity. Existing methods tend to focus on a single dimension of system aspects—such as control flow, data flow or timing constraints—or, at most, consider two of these perspectives without integrating all three. In addition, data flow models generally represent high-level data abstraction without including operational details within underlying contexts. The inability of these models to capture system behavior undermines their reliability, ultimately increasing the likelihood of the corresponding systems malfunctioning. To address these issues, we propose a formal verification method based on a timed Petri net with database tables (TPDT-net). First, we model the system using TPDT-net and generate its state reachability graph (SRG). Next, we extend timed computation tree logic (TCTL) by introducing database-related data element operators, thus proposing a database-oriented TCTL (DTCTL) model checking method. In addition, we formalize the system correctness problem as corresponding DTCTL formulas, which are analyzed based on the SRG. This approach transforms correctness verification into a satisfiability problem of DTCTL formulas within the SRG. Finally, we validate the practicality and effectiveness of the proposed method through case studies and experiments.\",\"PeriodicalId\":48915,\"journal\":{\"name\":\"IEEE Transactions on Systems Man Cybernetics-Systems\",\"volume\":\"55 10\",\"pages\":\"7410-7424\"},\"PeriodicalIF\":8.7000,\"publicationDate\":\"2025-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Systems Man Cybernetics-Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11087805/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Systems Man Cybernetics-Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11087805/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

随着系统复杂性的增加,正式验证对于确保系统功能、可靠性和安全性变得越来越重要。现有的方法倾向于关注系统方面的单个维度——例如控制流、数据流或时间约束——或者最多只考虑其中的两个透视图,而不集成所有三个透视图。此外,数据流模型通常表示高级数据抽象,而不包括底层上下文中的操作细节。这些模型捕捉系统行为的无能削弱了它们的可靠性,最终增加了相应系统故障的可能性。为了解决这些问题,我们提出了一种基于带数据库表的定时Petri网(TPDT-net)的形式化验证方法。首先,我们使用TPDT-net对系统建模,并生成其状态可达图(SRG)。其次,我们通过引入与数据库相关的数据元素运算符扩展了时间计算树逻辑(TCTL),从而提出了一种面向数据库的时间计算树逻辑(DTCTL)模型检查方法。此外,我们将系统正确性问题形式化为相应的DTCTL公式,并基于SRG对其进行了分析。这种方法将正确性验证转化为SRG内DTCTL公式的可满足性问题。最后,通过案例分析和实验验证了该方法的实用性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Innovative Formal Verification Method Based on Timed Petri Nets With Integrated Database Tables
Formal verification becomes increasingly critical to ensure system functionality, reliability and safety as they grow in complexity. Existing methods tend to focus on a single dimension of system aspects—such as control flow, data flow or timing constraints—or, at most, consider two of these perspectives without integrating all three. In addition, data flow models generally represent high-level data abstraction without including operational details within underlying contexts. The inability of these models to capture system behavior undermines their reliability, ultimately increasing the likelihood of the corresponding systems malfunctioning. To address these issues, we propose a formal verification method based on a timed Petri net with database tables (TPDT-net). First, we model the system using TPDT-net and generate its state reachability graph (SRG). Next, we extend timed computation tree logic (TCTL) by introducing database-related data element operators, thus proposing a database-oriented TCTL (DTCTL) model checking method. In addition, we formalize the system correctness problem as corresponding DTCTL formulas, which are analyzed based on the SRG. This approach transforms correctness verification into a satisfiability problem of DTCTL formulas within the SRG. Finally, we validate the practicality and effectiveness of the proposed method through case studies and experiments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Systems Man Cybernetics-Systems
IEEE Transactions on Systems Man Cybernetics-Systems AUTOMATION & CONTROL SYSTEMS-COMPUTER SCIENCE, CYBERNETICS
CiteScore
18.50
自引率
11.50%
发文量
812
审稿时长
6 months
期刊介绍: The IEEE Transactions on Systems, Man, and Cybernetics: Systems encompasses the fields of systems engineering, covering issue formulation, analysis, and modeling throughout the systems engineering lifecycle phases. It addresses decision-making, issue interpretation, systems management, processes, and various methods such as optimization, modeling, and simulation in the development and deployment of large systems.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信