On the Complexity of LtlModel-Checking of Recursive State Machines

Torre, Salvatore La and Parlato, Gennaro (2007) On the Complexity of LtlModel-Checking of Recursive State Machines At ICALP, Poland. 09 - 13 Jul 2007. , pp. 937-948.


[img] PDF fulltext(2).pdf - Version of Record
Download (544kB)


Recursive state machines (rsms) are models for programs with recursive procedural calls. While Ltl model-checking is Exptime-complete on such models, on finite-state machines, it is Pspace-complete in general and becomes Np-complete for interesting fragments. In this paper, we systematically study the computational complexity of model-checking rsm s against several syntactic fragments of Ltl. Our main result shows that if in the specification we disallow next and until, and retain only the box and diamond operators, model-checking is in Np. Thus, differently from the full logic, for this fragment the abstract complexity of model-checking does not change moving from finite-state machines to rsms. Our results on the other studied fragments confirm this trend, in the sense that, moving from finite-state machines to rsm s, the complexity of model-checking either rises from Pspace-complete to Exptime-complete, or stays within Np.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: July 9-13, 2007
Venue - Dates: ICALP, Poland, 2007-07-09 - 2007-07-13
Organisations: Electronic & Software Systems
ePrint ID: 272464
Date :
Date Event
Date Deposited: 13 Jun 2011 14:39
Last Modified: 17 Apr 2017 17:44
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/272464

Actions (login required)

View Item View Item