✦ LIBER ✦

SAT-Solving the Coverability Problem for Petri Nets

✍ Scribed by ParoshAziz Abdulla; S.Purushothaman Iyer; Aletta Nylén

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the coverability and reachability lan

✍ Delzanno, Giorgio; Rosa-Velardo, Fernando 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 492 KB

On the finite containment problem for Pe

✍ P. Clote 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 322 KB

A simple algorithm for solving the cover

✍ A. V. Klimov 📂 Article 📅 2012 🏛 Allerton Press Inc 🌐 English ⚖ 242 KB

Petri net based node structures for dist

✍ Dewasurendra S. Devapriya; Bernard Descotes-Genon; Pierre Ladet 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 907 KB

Solving resource-constrained multiple pr

✍ Yu Wu; Xin-cun Zhuang; Guo-hui Song; Xiao-dong Xu; Cong-xin Li 📂 Article 📅 2009 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 312 KB

Reduction of the supervisory control pro

✍ G. Stremersch; R. Boel 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 268 KB