@inproceedings{10.1007/3-540-63139-9_32,
    Abstract = {We study the complexity of model-checking Petri Nets w.r.t. the prepositional linear-time $\mu$-calculus. Esparza has shown in [5] that it is decidable, but the space complexity of his algorithm is exponential in the size of the system and double exponential in the size of the formula. In this paper we show that the complexity in the size of the formula can be reduced to polynomial space. We also prove that this is the best one can do. We also show that for the subclass of BPPs the problem has already the same complexity as for arbitrary nets. Furthermore we obtain the same results for the linear time temporal logic LTL, which is strictly less expressive than the linear-time $\mu$-calculus.},
    Address = {Berlin, Heidelberg},
    Author = {Habermehl, Peter},
    BookTitle = {Application and Theory of Petri Nets 1997},
    Editor = {Az{\'e}ma, Pierre and Balbo, Gianfranco},
    File = {Habermehl1997\_Chapter\_OnTheComplexityOfTheLinear-tim (0) - a - a - j.pdf},
    ISBN = {978-3-540-69187-7},
    Pages = {102--116},
    Publisher = {Springer Berlin Heidelberg},
    Title = {On the complexity of the linear-time $\mu$-calculus for Petri Nets},
    Year = {1997},
    date-added = {2018-10-11 11:38:03 +0000},
    date-modified = {2018-10-11 11:38:03 +0000},
    file-2 = {Hab-icatpn97 (0) - a - a - j.pdf},
    doi = {10.1007/3-540-63139-9_32}
}

@inproceedings{10.1007/3-540-63139-9_32, Abstract = {We study the complexity of model-checking Petri Nets w.r.t. the prepositional linear-time $\mu$-calculus. Esparza has shown in [5] that it is decidable, but the space complexity of his algorithm is exponential in the size of the system and double exponential in the size of the formula. In this paper we show that the complexity in the size of the formula can be reduced to polynomial space. We also prove that this is the best one can do. We also show that for the subclass of BPPs the problem has already the same complexity as for arbitrary nets. Furthermore we obtain the same results for the linear time temporal logic LTL, which is strictly less expressive than the linear-time $\mu$-calculus.}, Address = {Berlin, Heidelberg}, Author = {Habermehl, Peter}, BookTitle = {Application and Theory of Petri Nets 1997}, Editor = {Az{\'e}ma, Pierre and Balbo, Gianfranco}, File = {Habermehl1997_Chapter_OnTheComplexityOfTheLinear-tim (0) - a - a - j.pdf}, ISBN = {978-3-540-69187-7}, Pages = {102--116}, Publisher = {Springer Berlin Heidelberg}, Title = {On the complexity of the linear-time $\mu$-calculus for Petri Nets}, Year = {1997}, date-added = {2018-10-11 11:38:03 +0000}, date-modified = {2018-10-11 11:38:03 +0000}, file-2 = {Hab-icatpn97 (0) - a - a - j.pdf}, doi = {10.1007/3-540-63139-9_32} }