Lars Kuhtz, Bernd Finkbeiner. LTL Path Checking Is Efficiently Parallelizable. In Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas, editors, Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II. Volume 5556 of Lecture Notes in Computer Science, pages 235-246, Springer, 2009. [doi]
@inproceedings{KuhtzF09, title = {LTL Path Checking Is Efficiently Parallelizable}, author = {Lars Kuhtz and Bernd Finkbeiner}, year = {2009}, doi = {10.1007/978-3-642-02930-1_20}, url = {http://dx.doi.org/10.1007/978-3-642-02930-1_20}, researchr = {https://researchr.org/publication/KuhtzF09}, cites = {0}, citedby = {0}, pages = {235-246}, booktitle = {Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II}, editor = {Susanne Albers and Alberto Marchetti-Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas}, volume = {5556}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-02929-5}, }