Cited By
View all- Feng SCarapelle CGil OQuaas K(2019)MTL and TPTL for One-Counter MachinesACM Transactions on Computational Logic10.1145/337278921:2(1-34)Online publication date: 20-Dec-2019
- Lazić RSchmitz SKoskinen EGrohe MShankar N(2016)The Complexity of Coverability in ν-Petri NetsProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2933593(467-476)Online publication date: 5-Jul-2016
- Lazić RTotzke P(2016)What Makes Petri Nets Harder to Verify: Stack or Data?Concurrency, Security, and Puzzles10.1007/978-3-319-51046-0_8(144-161)Online publication date: 18-Dec-2016