The complexity of soundness in workflow nets-Reference-Cited by-同舟云学术

The complexity of soundness in workflow nets

Published:2022-08-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Blondin Michael¹,Mazowiecki Filip²,Offtermatt Philip³

Affiliation:

1. Universite de Sherbrooke, Canada

2. Max Planck Institute for Software Systems, Saarland Informatics Campus Saarbrücken, Germany

3. Universite de Sherbrooke, Canada and Max Planck Institute for Software Systems, Saarland Informatics Campus Saarbrücken, Germany

Funder

Fonds de recherche du Québec – Nature et technologies

Natural Sciences and Engineering Research Council of Canada

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3531130.3533341

Reference29 articles.

1. Kamel Barkaoui and Laure Petrucci . 1998 . Structural analysis of workflow nets with shared resources . In Proc. Workflow Management: Net-based Concepts, Models, Techniques and Tools (WFM), Vol. 98/7. 82–95 . Kamel Barkaoui and Laure Petrucci. 1998. Structural analysis of workflow nets with shared resources. In Proc. Workflow Management: Net-based Concepts, Models, Techniques and Tools (WFM), Vol. 98/7. 82–95.

2. The ABCs of petri net reachability relaxations

3. Cyclic Petri Net Reachability Sets are Semi-linear Effectively Constructible

4. Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)

5. Complexity results for 1-safe nets

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Soundness of reset workflow nets;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Fast Termination and Workflow Nets;Computer Aided Verification;2023

3. Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations;Computer Aided Verification;2022