On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets-Reference-Cited by-同舟云学术

On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets

Published:2021 Issue: Volume: Page:164-185
ISSN:0302-9743
Container-title:Application and Theory of Petri Nets and Concurrency
language:
Short-container-title:

Author:

Amat Nicolas^ORCID,Berthomieu Bernard^ORCID,Dal Zilio Silvano^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-76983-3_9

Reference33 articles.

1. Amat, N.: A New Approach for the Symbolic Model Checking of Petri nets. Master’s thesis, University of Grenoble (2020)

2. Lecture Notes in Computer Science;F Kordon,2018

3. Lecture Notes in Computer Science;A Armando,2006

4. Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Technical report, Department of Computer Science, The University of Iowa (2017). http://www.smt-lib.org/

5. Lecture Notes in Computer Science;G Berthelot,1987

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

1. Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability;Lecture Notes in Computer Science;2023-12-30

2. A Toolchain to Compute Concurrent Places of Petri Nets;Transactions on Petri Nets and Other Models of Concurrency XVII;2023-11-01

3. SMPT: A Testbed for Reachability Methods in Generalized Petri Nets;Formal Methods;2023

4. Potency-Based Heuristic Search with Randomness for Explicit Model Checking;Model Checking Software;2023

5. Automated Polyhedral Abstraction Proving;Application and Theory of Petri Nets and Concurrency;2023