The University of Southampton
University of Southampton Institutional Repository

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.

Record type: Conference or Workshop Item (Paper)


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.

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

More information

Published date: 2007
Additional Information: Event Dates: July 9-13, 2007
Venue - Dates: ICALP, Poland, 2007-07-09 - 2007-07-13
Organisations: Electronic & Software Systems


Local EPrints ID: 272464
ISBN: 978-3-540-73419-2
PURE UUID: 7b5965ab-9ae8-4b9b-b09e-1ced3ba19802

Catalogue record

Date deposited: 13 Jun 2011 14:39
Last modified: 18 Jul 2017 06:24

Export record


Author: Salvatore La Torre
Author: Gennaro Parlato

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.