Hierarchical and Recursive State Machines with Context-Dependent Properties
Hierarchical and Recursive State Machines with Context-Dependent Properties
Hierarchical and recursive state machines are suitable abstract models for many software systems. In this paper we extend a model recently introduced in literature, by allowing atomic propositions to label all the kinds of vertices and not only basic nodes. We call the obtained models context-dependent hierarchical/recursive state machines. We study on such models cycle detection, reachability and Ltl model-checking. Despite of a more succinct representation, we prove that Ltl model-checking can be done in time linear in the size of the model and exponential in the size of the formula, as for standard Ltl model-checking. Reachability and cycle detection become NP-complete, and if we place some restrictions on the representation of the target states, we can decide them in time linear in the size of the formula and the size of the model.
3-540-40493-7
776-789
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Napoli, Margherita
283e44c3-187a-4bdb-a582-79dbfe18aac8
Parente, Mimmo
83960b32-bcf3-4c34-a78a-c0d20f1bc2a1
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
2003
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Napoli, Margherita
283e44c3-187a-4bdb-a582-79dbfe18aac8
Parente, Mimmo
83960b32-bcf3-4c34-a78a-c0d20f1bc2a1
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Torre, Salvatore La, Napoli, Margherita, Parente, Mimmo and Parlato, Gennaro
(2003)
Hierarchical and Recursive State Machines with Context-Dependent Properties.
ICALP, June 30 - July 4, 2003.
30 Jun - 04 Jul 2003.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
Hierarchical and recursive state machines are suitable abstract models for many software systems. In this paper we extend a model recently introduced in literature, by allowing atomic propositions to label all the kinds of vertices and not only basic nodes. We call the obtained models context-dependent hierarchical/recursive state machines. We study on such models cycle detection, reachability and Ltl model-checking. Despite of a more succinct representation, we prove that Ltl model-checking can be done in time linear in the size of the model and exponential in the size of the formula, as for standard Ltl model-checking. Reachability and cycle detection become NP-complete, and if we place some restrictions on the representation of the target states, we can decide them in time linear in the size of the formula and the size of the model.
Text
fulltext(4).pdf
- Version of Record
More information
Published date: 2003
Additional Information:
Event Dates: June 30 - July 4, 2003
Venue - Dates:
ICALP, June 30 - July 4, 2003, 2003-06-30 - 2003-07-04
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 272469
URI: http://eprints.soton.ac.uk/id/eprint/272469
ISBN: 3-540-40493-7
PURE UUID: 57d04f4e-c758-44b1-945b-a2b2c3830d6a
Catalogue record
Date deposited: 13 Jun 2011 14:56
Last modified: 14 Mar 2024 10:02
Export record
Contributors
Author:
Salvatore La Torre
Author:
Margherita Napoli
Author:
Mimmo Parente
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