@inproceedings{10.1007/BFb0017477,
Abstract = {The decidability of the model checking problem for several $\mu$-calculi and Petri nets is analysed. The linear time $\mu$-calculus without atomic sentences is decidable; if simple atomic sentences are added, it becomes undecidable. A very simple subset of the modal $\mu$-calculus is undecidable.},
Address = {Berlin, Heidelberg},
Author = {Esparza, Javier},
BookTitle = {Trees in Algebra and Programming --- CAAP'94},
Editor = {Tison, Sophie},
File = {On the decidability of model checking for several {$\mu$}-calculi and Petri nets - CAAP94 - p - p.pdf},
ISBN = {978-3-540-48373-1},
Pages = {115--129},
Publisher = {Springer Berlin Heidelberg},
Title = {On the decidability of model checking for several $\mu$-calculi and Petri nets},
Year = {1994},
date-added = {2021-03-18 09:09:16 +0100},
date-modified = {2021-03-18 09:09:16 +0100},
file-2 = {On the decidability of model checking for several {$\mu$}-calculi and Petri nets - ECS-LFCS-93-274 - p - p.ps},
doi = {10.1007/BFb0017477}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A