Author:
Decker Normann,Thoma Daniel
Publisher
Springer Berlin Heidelberg
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The ideal view on Rackoff's coverability technique;Information and Computation;2021-04
2. Introduction to Runtime Verification;Lectures on Runtime Verification;2018
3. What Makes Petri Nets Harder to Verify: Stack or Data?;Concurrency, Security, and Puzzles;2016-12-18
4. The Complexity of Coverability in ν-Petri Nets;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05