Verification of Succinct Hierarchical State Machines


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).

Download

[img] PDF lata07.pdf - Other
Download (235kB)

Description/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.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: Conference on Language and Automata Theory and Applications (LATA), 2007-01-01
Organisations: Electronic & Software Systems
ePrint ID: 370685
Date :
Date Event
2007Published
Date Deposited: 03 Nov 2014 09:48
Last Modified: 22 Feb 2017 11:21
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/370685

Actions (login required)

View Item View Item