On the Complexity of LtlModel-Checking of Recursive State Machines
On the Complexity of LtlModel-Checking of Recursive State Machines
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.
978-3-540-73419-2
937-948
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
2007
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Torre, Salvatore La and Parlato, Gennaro
(2007)
On the Complexity of LtlModel-Checking of Recursive State Machines.
ICALP, Wroclaw, Poland.
09 - 13 Jul 2007.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
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.
Text
fulltext(2).pdf
- Version of Record
More information
Published date: 2007
Additional Information:
Event Dates: July 9-13, 2007
Venue - Dates:
ICALP, Wroclaw, Poland, 2007-07-09 - 2007-07-13
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 272464
URI: http://eprints.soton.ac.uk/id/eprint/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: 14 Mar 2024 10:02
Export record
Contributors
Author:
Salvatore La Torre
Author:
Gennaro Parlato
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