发现并发迭代过程的工作流网络

IF 0.4 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Acta Informatica Pub Date : 2023-09-14 DOI:10.1007/s00236-023-00445-5
Tonatiuh Tapia-Flores, Ernesto López-Mellado
{"title":"发现并发迭代过程的工作流网络","authors":"Tonatiuh Tapia-Flores,&nbsp;Ernesto López-Mellado","doi":"10.1007/s00236-023-00445-5","DOIUrl":null,"url":null,"abstract":"<div><p>A novel and efficient method for discovering concurrent workflow processes is presented. It allows building a suitable workflow net (WFN) from a large event log <span>\\(\\lambda \\)</span>, which represents the behaviour of complex iterative processes involving concurrency. First, the <i>t</i>-invariants are determined from <span>\\(\\lambda \\)</span>; this allows computing the causal and concurrent relations between the events and the implicit causal relations between events that do not appear consecutively in <span>\\(\\lambda \\)</span>. Then a 1-bounded WFN is built, which could be eventually adjusted if its <i>t</i>-invariants do not match with those computed from <span>\\(\\lambda \\)</span>. The discovered model allows firing all the traces in <span>\\(\\lambda \\)</span>. The procedures derived from the method are polynomial time on <span>\\(|\\lambda |\\)</span>; they have been implemented and tested on artificial logs.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-023-00445-5.pdf","citationCount":"0","resultStr":"{\"title\":\"Discovering workflow nets of concurrent iterative processes\",\"authors\":\"Tonatiuh Tapia-Flores,&nbsp;Ernesto López-Mellado\",\"doi\":\"10.1007/s00236-023-00445-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A novel and efficient method for discovering concurrent workflow processes is presented. It allows building a suitable workflow net (WFN) from a large event log <span>\\\\(\\\\lambda \\\\)</span>, which represents the behaviour of complex iterative processes involving concurrency. First, the <i>t</i>-invariants are determined from <span>\\\\(\\\\lambda \\\\)</span>; this allows computing the causal and concurrent relations between the events and the implicit causal relations between events that do not appear consecutively in <span>\\\\(\\\\lambda \\\\)</span>. Then a 1-bounded WFN is built, which could be eventually adjusted if its <i>t</i>-invariants do not match with those computed from <span>\\\\(\\\\lambda \\\\)</span>. The discovered model allows firing all the traces in <span>\\\\(\\\\lambda \\\\)</span>. The procedures derived from the method are polynomial time on <span>\\\\(|\\\\lambda |\\\\)</span>; they have been implemented and tested on artificial logs.</p></div>\",\"PeriodicalId\":7189,\"journal\":{\"name\":\"Acta Informatica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00236-023-00445-5.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Informatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00236-023-00445-5\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Informatica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00236-023-00445-5","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

本文介绍了一种发现并发工作流流程的高效新方法。该方法允许从大型事件日志(\\lambda \)中构建一个合适的工作流网(WFN),该工作流网代表了涉及并发的复杂迭代流程的行为。首先,从 \(\lambda \)中确定 t-变量;这样就可以计算事件之间的因果关系和并发关系,以及在 \(\lambda \)中没有连续出现的事件之间的隐含因果关系。然后建立一个 1-bounded WFN,如果它的 t-invariants 与从\(\lambda \)中计算出的 t-invariants 不匹配,那么最终可以对它进行调整。被发现的模型允许触发所有的轨迹。从该方法中得出的程序在 \(|\lambda |\) 上是多项式时间;它们已在人工日志上实现并进行了测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Discovering workflow nets of concurrent iterative processes

A novel and efficient method for discovering concurrent workflow processes is presented. It allows building a suitable workflow net (WFN) from a large event log \(\lambda \), which represents the behaviour of complex iterative processes involving concurrency. First, the t-invariants are determined from \(\lambda \); this allows computing the causal and concurrent relations between the events and the implicit causal relations between events that do not appear consecutively in \(\lambda \). Then a 1-bounded WFN is built, which could be eventually adjusted if its t-invariants do not match with those computed from \(\lambda \). The discovered model allows firing all the traces in \(\lambda \). The procedures derived from the method are polynomial time on \(|\lambda |\); they have been implemented and tested on artificial logs.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Acta Informatica
Acta Informatica 工程技术-计算机:信息系统
CiteScore
2.40
自引率
16.70%
发文量
24
审稿时长
>12 weeks
期刊介绍: Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.
期刊最新文献
Editorial 2024: moving forwards in the electronic age Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm Linear-size suffix tries and linear-size CDAWGs simplified and improved Parameterized aspects of distinct Kemeny rank aggregation Word-representable graphs from a word’s perspective
×
引用
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