{"title":"发现并发迭代过程的工作流网络","authors":"Tonatiuh Tapia-Flores, 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, 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}
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 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.