The University of Southampton
University of Southampton Institutional Repository

Verification of scope-dependent hierarchical state machines

Verification of scope-dependent hierarchical state machines
Verification of scope-dependent hierarchical state machines
A hierarchical state machine (Hsm) is a finite state machine where a vertex can either expand to another hierarchical state machine (box) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (Shsm). We show that Shsms can be exponentially more succinct than Shsms and verification is in general harder by an exponential factor. We carefully establish the computational complexity of reachability, cycle detection, and model checking against general Ltl and Ctl specifications. We also discuss some natural and interesting restrictions of the considered problems for which we can prove that Shsms can be verified as much efficiently as Hsms, still preserving an exponential gap of succinctness.
1161-1177
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
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 (2008) Verification of scope-dependent hierarchical state machines. Inf. Comput., 206 (9-10), 1161-1177.

Record type: Article

Abstract

A hierarchical state machine (Hsm) is a finite state machine where a vertex can either expand to another hierarchical state machine (box) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (Shsm). We show that Shsms can be exponentially more succinct than Shsms and verification is in general harder by an exponential factor. We carefully establish the computational complexity of reachability, cycle detection, and model checking against general Ltl and Ctl specifications. We also discuss some natural and interesting restrictions of the considered problems for which we can prove that Shsms can be verified as much efficiently as Hsms, still preserving an exponential gap of succinctness.

Text
sdarticle.pdf - Version of Record
Download (493kB)

More information

Published date: 2008
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 272463
URI: http://eprints.soton.ac.uk/id/eprint/272463
PURE UUID: bcea1227-dfe4-461b-8fe1-ad95611935dc

Catalogue record

Date deposited: 13 Jun 2011 14:33
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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

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.

×