Publisher
Springer International Publishing
Reference33 articles.
1. Amat, N.: Oracles and report for the reachability category of the model checking contest (2022). https://github.com/nicolasAmat/MCC-Reachability
2. Lecture Notes in Computer Science;N Amat,2021
3. Amat, N., Berthomieu, B., Dal Zilio, S.: A polyhedral abstraction for petri nets and its application to SMT-based model checking. Fund. Inform. 187(2–4), 103–138. IOS Press (2022). https://doi.org/10.3233/FI-222134
4. Amat, N., Dal Zilio, S.: Artifact for FM 2023 paper: SMPT: a testbed for reachability methods in generalized petri nets, November 2023. https://doi.org/10.5281/zenodo.7341426
5. Amat, N., Dal Zilio, S., Hujsa, T.: Artifact for TACAS 2022 paper: property directed reachability for generalized petri nets, January 2022. https://doi.org/10.5281/zenodo.5863379
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Implementation Analysis of Reachability Graph and Its Application in Net Learning;2024 4th International Conference on Computer, Control and Robotics (ICCCR);2024-04-19
2. Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability;Lecture Notes in Computer Science;2023-12-30
3. A Toolchain to Compute Concurrent Places of Petri Nets;Transactions on Petri Nets and Other Models of Concurrency XVII;2023-11-01
4. Automated Polyhedral Abstraction Proving;Application and Theory of Petri Nets and Concurrency;2023