On the decidability of model checking for several (mu)-calculi and Petri nets
by Javier Esparza
Part of LFCS report series -- ECS-LFCS-93-274
No club is reading this yet — be the first to start one
Discuss On the decidability of model checking for several (mu)-calculi and Petri nets with other readers
Join or start a book club for On the decidability of model checking for several (mu)-calculi and Petri nets on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for On the decidability of model checking for several (mu)-calculi and Petri nets?
Sign up free on Readfeed, then browse public clubs or start your own club with On the decidability of model checking for several (mu)-calculi and Petri nets as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss On the decidability of model checking for several (mu)-calculi and Petri nets with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about On the decidability of model checking for several (mu)-calculi and Petri nets with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.