Salvatore La Torre, Gennaro Parlato. On the Complexity of LtlModel-Checking of Recursive State Machines. In Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki, editors, Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings. Volume 4596 of Lecture Notes in Computer Science, pages 937-948, Springer, 2007. [doi]
@inproceedings{TorreP07, title = {On the Complexity of LtlModel-Checking of Recursive State Machines}, author = {Salvatore La Torre and Gennaro Parlato}, year = {2007}, doi = {10.1007/978-3-540-73420-8_80}, url = {http://dx.doi.org/10.1007/978-3-540-73420-8_80}, tags = {state machines}, researchr = {https://researchr.org/publication/TorreP07}, cites = {0}, citedby = {0}, pages = {937-948}, booktitle = {Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings}, editor = {Lars Arge and Christian Cachin and Tomasz Jurdzinski and Andrzej Tarlecki}, volume = {4596}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-73419-2}, }