找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Verification of Data-Aware Processes via Satisfiability Modulo Theories; Alessandro Gianola Book 2023 The Editor(s) (if applicable) and Th

[复制链接]
查看: 6363|回复: 56
发表于 2025-3-21 19:27:17 | 显示全部楼层 |阅读模式
书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories
编辑Alessandro Gianola
视频video
概述Received the BPM 2022 Dissertation award for an outstanding thesis in the field of business process management.Applies principles, methods and techniques from automated reasoning to business processes
丛书名称Lecture Notes in Business Information Processing
图书封面Titlebook: Verification of Data-Aware Processes via Satisfiability Modulo Theories;  Alessandro Gianola Book 2023 The Editor(s) (if applicable) and Th
描述.This book is a revised version of the PhD dissertation written by the author at the Free University of Bozen-Bolzano in Italy...It presents a new approach to safety verification of a particular class of infinite-state systems, called Data-Aware Processes (DAPs). To do so, the developed technical machinery requires to devise novel results for uniform interpolation and its combination in the context of automated reasoning. These results are then applied to the analysis of concrete business processes enriched with real data..In 2022, the PhD dissertation won the “BPM Dissertation Award”, granted to outstanding PhD theses in the field of Business Process Management... .
出版日期Book 2023
关键词Business Process Management; Business Process Verification; Data-Aware Processes; Model Checking; Automa
版次1
doihttps://doi.org/10.1007/978-3-031-42746-6
isbn_softcover978-3-031-42745-9
isbn_ebook978-3-031-42746-6Series ISSN 1865-1348 Series E-ISSN 1865-1356
issn_series 1865-1348
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories影响因子(影响力)




书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories影响因子(影响力)学科排名




书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories网络公开度




书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories网络公开度学科排名




书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories被引频次




书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories被引频次学科排名




书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories年度引用




书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories年度引用学科排名




书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories读者反馈




书目名称Verification of Data-Aware Processes via Satisfiability Modulo Theories读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:08:18 | 显示全部楼层
发表于 2025-3-22 04:16:53 | 显示全部楼层
Book 2023pplied to the analysis of concrete business processes enriched with real data..In 2022, the PhD dissertation won the “BPM Dissertation Award”, granted to outstanding PhD theses in the field of Business Process Management... .
发表于 2025-3-22 07:54:43 | 显示全部楼层
发表于 2025-3-22 10:31:31 | 显示全部楼层
DABs: a Theoretical Framework for Data-Aware BPMNanslated into RASs, so as to transfer the verification results for RASs to this BPMN-oriented model. DABs are similar in spirit to artifact systems concerning the treatment of relational data, but employ a fragment of the BPMN language to express the process schema.
发表于 2025-3-22 16:41:41 | 显示全部楼层
Safety Verification of Artifact Systemsnon-trivial extension of the SMT-based version of the . studied in the context of array-based systems. We focus on the verification issues created by the presence of data in SASs and (Universal) RASs, and how to solve them with the use of quantifier elimination in model completions.
发表于 2025-3-22 18:13:10 | 显示全部楼层
Decidability Results via Termination of the Verification Machineryination is a difficult problem to attack in general, in the context of array-based systems. We provide guarantees of termination in three cases. The first one is for SASs, and requires that the DB schema is .. The other two are about suitable subclasses of RASs, for which termination is proved by ex
发表于 2025-3-22 22:11:43 | 显示全部楼层
Uniform Interpolation for Database Theoriesifiers in model completions. In order to do so, we first show that eliminating quantifiers in model completions . is equivalent to the problem of computing .. The notion of cover has been studied in symbolic model checking in the context of program synthesis and verification; covers are well-known a
发表于 2025-3-23 03:13:37 | 显示全部楼层
Combination of Uniform Interpolants for DAPs Verificationd computing combined covers is particularly interesting in view of DAP verification. We would like to investigate a general method that works for combination of DB schemas for which cover algorithms exist: in this way, whenever we get such algorithms for the component theories, we can easily combine
发表于 2025-3-23 08:27:36 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 23:26
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表