The University of Southampton
University of Southampton Institutional Repository

Verification of Succinct Hierarchical State Machines

Verification of Succinct Hierarchical State Machines
Verification of Succinct 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 HSMs, and verification is in general harder by an exponential factor. Also, we show for a subclass of SHSMs (which can still be exponentially more succinct than HSMs) the same upper bounds as for HSMs.
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Napoli, Margherita
283e44c3-187a-4bdb-a582-79dbfe18aac8
Parente, Mimmo
83960b32-bcf3-4c34-a78a-c0d20f1bc2a1
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Napoli, Margherita
283e44c3-187a-4bdb-a582-79dbfe18aac8
Parente, Mimmo
83960b32-bcf3-4c34-a78a-c0d20f1bc2a1
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923

La Torre, Salvatore, Napoli, Margherita, Parente, Mimmo and Parlato, Gennaro (2007) Verification of Succinct Hierarchical State Machines At Conference on Language and Automata Theory and Applications (LATA).

Record type: Conference or Workshop Item (Paper)

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 HSMs, and verification is in general harder by an exponential factor. Also, we show for a subclass of SHSMs (which can still be exponentially more succinct than HSMs) the same upper bounds as for HSMs.

PDF lata07.pdf - Other
Download (235kB)

More information

Published date: 2007
Venue - Dates: Conference on Language and Automata Theory and Applications (LATA), 2007-01-01
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 370685
URI: https://eprints.soton.ac.uk/id/eprint/370685
PURE UUID: 115625de-c7a9-445a-bd75-33c29211bce9

Catalogue record

Date deposited: 03 Nov 2014 09:48
Last modified: 17 Jul 2017 21:49

Export record

Contributors

Author: Salvatore La Torre
Author: Margherita Napoli
Author: Mimmo Parente
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

Library staff edit
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 https://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.

×